1197 search results - page 54 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICDCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
TON
2002
13 years 9 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
JAIR
2008
13 years 9 months ago
2008
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
COR
2006
13 years 9 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
CPAIOR
2010
Springer
14 years 18 days ago
2010
Springer
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...