601 search results - page 40 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
101
click to vote
ENDM
2000
15 years 1 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
114
click to vote
AAAI
2008
15 years 3 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
123
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
125
click to vote
FOCI
2007
IEEE
15 years 7 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
AUTOMATICA
2008
15 years 1 months ago
2008
This paper addresses the synthesis approach to output feedback robust model predictive control for systems with polytopic description, bounded state disturbance and measurement no...