Sciweavers

2109 search results - page 92 / 422
» Solving Necklace Constraint Problems
Sort
View
CSCLP
2005
Springer
15 years 10 months ago
Partitioning Based Algorithms for Some Colouring Problems
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
Ola Angelsmark, Johan Thapper
ICCV
1998
IEEE
16 years 6 months ago
Minimizing Algebraic Error in Geometric Estimation Problems
This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minim...
Richard I. Hartley
120
Voted
AIPS
2008
15 years 7 months ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
IJCAI
1993
15 years 6 months ago
Genetic State-Space Search for Constrained Optimization Problems
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
Jan Paredis
ICIP
2006
IEEE
16 years 6 months ago
Knowledge-Based Supervised Learning Methods in a Classical Problem of Video Object Tracking
In this paper we present a new scheme for detection and tracking of specific objects in a knowledge-based framework. The scheme uses a supervised learning method: Support Vector M...
Lionel Carminati, Jenny Benois-Pineau, Christian J...