717 search results - page 126 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
PATAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but t...
TKDE
2008
14 years 9 months ago
2008
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
GECCO
2010
Springer
14 years 10 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...