Sciweavers

1040 search results - page 55 / 208
» Tools for modeling and solving search problems
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Implementing RPO and POLO using SAT
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
Peter Schneider-Kamp, Carsten Fuhs, René Th...
ATAL
2010
Springer
13 years 8 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
SAT
2007
Springer
181views Hardware» more  SAT 2007»
14 years 1 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
IPPS
1999
IEEE
14 years 14 hour ago
A Performance Model of Speculative Prefetching in Distributed Information Systems
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 1 months ago
A new evolutionary model for detecting multiple optima
Multimodal optimization problems consist in detecting all global and local optima of a problem. A new evolutionary approach to multimodal optimization called Roaming technique (RO...
Rodica Ioana Lung, D. Dumitrescu