601 search results - page 67 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
152
click to vote
RE
2007
Springer
16 years 6 days ago
2007
Springer
Requirements elicitation involves the construction of large sets of conceptual models. An important step in the analysis of these models is checking their consistency. Existing re...
149
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
164
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
145
click to vote
AAAI
2007
15 years 8 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
192
Voted
WACV
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper describes a new method to improve inertial navigation using feature-based constraints from one or more video cameras. The proposed method lengthens the period of tim...