882 search results - page 46 / 177 » Local Search for Very Large SAT Problems |
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It d...
106
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
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...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
In this paper, we propose a component-based discriminative approach for face alignment without requiring initialization1 . Unlike many approaches which locally optimize in a small ...
117
click to vote
AIPS
2006
15 years 1 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
102
click to vote
AI
2008
Springer
14 years 12 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...