566 search results - page 35 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
137
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
136
click to vote
SIGITE
2006
ACM
15 years 10 months ago
2006
ACM
Delivery of content in networking and system administration curricula involves significant hands-on laboratory experience supplementing traditional classroom instruction at the Ro...
121
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
125
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
122
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...