4117 search results - page 645 / 824 » On the Satisfiability of Complex Constraints |
172
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
181
click to vote
ACCV
1998
Springer
15 years 11 months ago
1998
Springer
A head tracking system for automatically detecting and tracking human heads in complex backgrounds is developed. In this paper, two issues are addressed: the detection ofhumanhead...
192
click to vote
VLSID
1997
IEEE
15 years 10 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
194
click to vote
AGP
1996
IEEE
15 years 10 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
186
click to vote
CVRMED
1997
Springer
15 years 10 months ago
1997
Springer
E cient and powerful topologically adaptable deformable surfaces can be created by embedding and de ning discrete deformable surface models in terms of an A ne Cell Decomposition (...