37 search results - page 5 / 8 » The Exact Closest String Problem as a Constraint Satisfactio... |
AAAI
2008
14 years 12 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...
CP
2008
Springer
14 years 11 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
164
click to vote
GIS
2004
ACM
15 years 10 months ago
2004
ACM
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
RSS
2007
14 years 11 months ago
2007
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...