Sciweavers

1300 search results - page 92 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
CP
1997
Springer
15 years 2 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
STACS
2010
Springer
15 years 3 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
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...
Rustem Takhanov
CSL
2008
Springer
14 years 12 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak
60
Voted
CVPR
2007
IEEE
16 years 4 days ago
Inferring Temporal Order of Images From 3D Structure
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
Grant Schindler, Frank Dellaert, Sing Bing Kang
ECAL
2005
Springer
15 years 3 months ago
Evolutionary Transitions as a Metaphor for Evolutionary Optimisation
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert