4117 search results - page 99 / 824 » On the Satisfiability of Complex Constraints |
174
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
198
click to vote
ANOR
2011
15 years 1 months ago
2011
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
156
click to vote
SRDS
1997
IEEE
15 years 10 months ago
1997
IEEE
Hazard situations in safety-critical systems are typically complex, so there is a need for means to detect complex hazards and react in a timely and meaningful way. This paper add...
157
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— A powerful path computation element is a must for the next-generation IP-over-Optical networks to support ondemand service provisioning crossing layers. The main purpose of pat...
188
click to vote
SARA
2009
Springer
16 years 27 days ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...