13987 search results - page 540 / 2798 » The Two Guards Problem |
192
click to vote
CP
2005
Springer
16 years 21 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
183
click to vote
ECML
2005
Springer
16 years 21 days ago
2005
Springer
We present a method for transferring knowledge learned in one task to a related task. Our problem solvers employ reinforcement learning to acquire a model for one task. We then tra...
246
click to vote
ANTSW
2004
Springer
16 years 17 days ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
181
click to vote
ICTAI
2003
IEEE
16 years 14 days ago
2003
IEEE
Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems ...
150
click to vote
EUROPAR
2003
Springer
16 years 12 days ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...