250 search results - page 16 / 50 » The complexity of temporal constraint satisfaction problems |
ICCAD
2004
IEEE
14 years 5 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 ...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...