805 search results - page 70 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
153
click to vote
IVC
2007
15 years 4 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
135
click to vote
HM
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
167
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
143
click to vote
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
136
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...