Sciweavers

38 search results - page 3 / 8
» Easy and Hard Testbeds for Real-Time Search Algorithms
Sort
View
SAC
2008
ACM
13 years 4 months ago
Towards a model-driven engineering approach for developing embedded hard real-time software
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
Fabiano Cruz, Raimundo S. Barreto, Lucas Cordeiro
SEFM
2007
IEEE
13 years 11 months ago
Hardness for Explicit State Software Model Checking Benchmarks
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
Neha Rungta, Eric G. Mercer
IJCAI
2001
13 years 6 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
ACL
2004
13 years 6 months ago
Annealing Techniques For Unsupervised Statistical Language Learning
Exploiting unannotated natural language data is hard largely because unsupervised parameter estimation is hard. We describe deterministic annealing (Rose et al., 1990) as an appea...
Noah A. Smith, Jason Eisner
CEC
2009
IEEE
14 years 3 days ago
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
Gabriela Ochoa, José Antonio Vázquez...