1589 search results - page 94 / 318 » Constraints with Variables' Annotations |
CDC
2009
IEEE
14 years 25 days ago
2009
IEEE
The concept of virtual holonomic constraints is extended to the case of double support, which is characterized by a closed kinematic chain and redundancy in the state variables. An...
CP
1995
Springer
14 years 11 days ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
FLAIRS
2007
13 years 11 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
AAAI
1998
13 years 10 months ago
1998
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
IJCAI
1989
13 years 10 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...