Sciweavers

1568 search results - page 55 / 314
» The problem of examination questions in algorithmics
Sort
View
CEC
2005
IEEE
15 years 3 days ago
Final exam scheduler - FES
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
Ender Özcan, Ersan Ersoy
ANSS
2002
IEEE
15 years 3 months ago
Scalability of Parallel Simulation Cloning
In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted f...
Maria Hybinette, Richard M. Fujimoto
ACL
1994
14 years 11 months ago
On Determining the Consistency of Partial Descriptions of Trees
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
Tom Cornell
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
13 years 18 days ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
85
Voted
CVPR
2007
IEEE
15 years 4 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...