601 search results - page 35 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
107
click to vote
JAIR
2008
15 years 1 months ago
2008
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
CSCLP
2007
Springer
15 years 7 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
117
click to vote
SARA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
124
click to vote
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...