633 search results - page 20 / 127 » Locality and Hard SAT-Instances |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Analysis of videos of human-object interactions involves understanding human movements, locating and recognizing objects and observing the effects of human movements on those obje...
AAAI
2000
13 years 10 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
JMLR
2012
11 years 11 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
IJCAI
2007
13 years 10 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
FLAIRS
2004
13 years 10 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...