1480 search results - page 84 / 296 » Ants can solve constraint satisfaction problems |
AIPS
1994
14 years 11 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
FLAIRS
2008
15 years 2 days ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
113
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
AAAI
1994
14 years 11 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...