601 search results - page 63 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
106
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We address the problem of tracking and recognizing faces in real-world, noisy videos. We track faces using a tracker that adaptively builds a target model reflecting changes in ap...
144
click to vote
CP
2010
Springer
15 years 3 days ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
117
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
110
click to vote
EAAI
2008
15 years 1 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
114
click to vote
CP
2007
Springer
15 years 7 months ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...