Sciweavers

1051 search results - page 66 / 211
» Foundations of Constraint Satisfaction
Sort
View
APIN
2006
142views more  APIN 2006»
14 years 10 months ago
Achieving dynamic, multi-commander, multi-mission planning and execution
The Multi-Agent Distributed Goal Satisfaction (MADGS) system facilitates distributed mission planning and execution in complex dynamic environments with a focus on distributed goal...
Eugene Santos, Scott A. DeLoach, Michael T. Cox
ICTAI
2006
IEEE
15 years 3 months ago
Finding Crucial Subproblems to Focus Global Search
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Susan L. Epstein, Richard J. Wallace
CP
2005
Springer
15 years 3 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...
IRI
2008
IEEE
15 years 4 months ago
Development of an evaluation model for Question Answering Systems
Question Answering Systems (QAS) are receiving increasing attention from information systems researchers, particularly those in the information retrieval and natural language proc...
Chorng-Shyong Ong, Min-Yuh Day, Wen-Lian Hsu
AI
2005
Springer
14 years 9 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo