592 search results - page 25 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
103
Voted
CPAIOR
2009
Springer
15 years 9 months ago
2009
Springer
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
124
Voted
CPAIOR
2004
Springer
15 years 6 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
108
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
126
Voted
IFIP
1998
Springer
15 years 6 months ago
1998
Springer
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...
140
Voted
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 7 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...