1480 search results - page 169 / 296 » Ants can solve constraint satisfaction problems |
186
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
Dealing with multi-object tracking in a particle filter raises several issues. A first essential point is to model possible interactions between objects. In this article, we repr...
204
click to vote
DATAMINE
2010
15 years 6 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
161
click to vote
ISLPED
2009
ACM
16 years 1 months ago
2009
ACM
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
173
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
160
click to vote
CP
2007
Springer
16 years 21 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...