566 search results - page 22 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
120
click to vote
FLAIRS
2007
15 years 2 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
86
Voted
FLAIRS
2004
15 years 1 months ago
2004
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
103
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
128
Voted
AAAI
2006
15 years 1 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
108
click to vote
JAIR
2010
14 years 10 months ago
2010
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...