Sciweavers

660 search results - page 33 / 132
» Hybrid CSP Solving
Sort
View
CP
2006
Springer
14 years 1 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
ICCV
2005
IEEE
14 years 11 months ago
Segmentation of Hybrid Motions via Hybrid Quadratic Surface Analysis
In this paper, we investigate the mathematical problem underlying segmentation of hybrid motions: Given a series of tracked feature correspondences between two (perspective) image...
Shankar Rao, Allen Y. Yang, Andrew Wagner, Yi Ma
IAT
2006
IEEE
14 years 3 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
CP
1999
Springer
14 years 2 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
CP
1995
Springer
14 years 1 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace