4524 search results - page 15 / 905 » The Complexity of Global Constraints |
113
click to vote
SI3D
2003
ACM
15 years 5 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
102
click to vote
AAAI
2008
15 years 2 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
90
Voted
CPAIOR
2009
Springer
15 years 7 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...
109
Voted
JCP
2006
15 years 10 days ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
111
click to vote
CSFW
2004
IEEE
15 years 4 months ago
2004
IEEE
Workflow management systems (WFMSs) have attracted a lot of interest both in academia and the business community. A workflow consists of a collection of tasks that are organized t...