239 search results - page 20 / 48 » The Parameterized Complexity of Global Constraints |
CP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
STACS
2010
Springer
14 years 21 days ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
SI3D
2003
ACM
14 years 25 days 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...
JCP
2006
13 years 7 months 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...