4117 search results - page 203 / 824 » On the Satisfiability of Complex Constraints |
120
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— The control approaches based on tasks, and particularly based on a hierarchy of tasks, enable to build complex behaviors with some nice properties of robustness and portability...
173
click to vote
SARA
2007
Springer
16 years 21 days ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
154
click to vote
ICTAI
2005
IEEE
16 years 5 days ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...
165
click to vote
CP
2005
Springer
16 years 4 days 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...
160
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...