1197 search results - page 41 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
2006
Springer
14 years 29 days ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
MICAI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
COLT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
CONSTRAINTS
2006
13 years 9 months ago
2006
Abstract. The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this pape...
ICT
2004
Springer
14 years 2 months ago
2004
Springer
The active networks approach has been presented as an alternative technology for solving several problems in conventional networks, mainly in the network management area. This work...