1480 search results - page 96 / 296 » Ants can solve constraint satisfaction problems |
SARA
2009
Springer
15 years 4 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
ICMCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
104
click to vote
CONSTRAINTS
2011
14 years 4 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...