1480 search results - page 123 / 296 » Ants can solve constraint satisfaction problems |
178
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
— Rigid body dynamics with contact constraints can be solved locally using linear complementarity techniques. However, these techniques do not impose the original constraints and...
211
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
156
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
173
click to vote
JAIR
2008
15 years 6 months ago
2008
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
170
click to vote
EOR
2007
15 years 6 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...