Sciweavers

1363 search results - page 190 / 273
» The road coloring problem
Sort
View
CP
2003
Springer
15 years 5 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
FLAIRS
2004
15 years 1 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
NGC
2006
Springer
135views Communications» more  NGC 2006»
14 years 11 months ago
Seeing Things: Inventive Reasoning with Geometric Analogies and Topographic Maps
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
Diarmuid P. O'Donoghue, Amy J. Bohan, Mark T. Kean...
IVC
2000
179views more  IVC 2000»
14 years 11 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
CVPR
2004
IEEE
16 years 1 months ago
Non-Rigid Shape and Motion Recovery: Degenerate Deformations
This paper studies the problem of 3D non-rigid shape and motion recovery from a monocular video sequence, under the degenerate deformations. The shape of a deformable object is re...
Jing Xiao, Takeo Kanade