1040 search results - page 42 / 208 » Tools for modeling and solving search problems |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
WEBI
2005
Springer
14 years 1 months ago
2005
Springer
Due to the enormous size of the web and low precision of user queries, finding the right information from the web can be difficult if not impossible. One approach that tries to ...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...