566 search results - page 35 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
107
click to vote
ECAI
2000
Springer
15 years 4 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...
105
Voted
SIGITE
2006
ACM
15 years 6 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...
CORR
2008
Springer
15 years 16 days 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...
95
Voted
CP
2008
Springer
15 years 2 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...
CPAIOR
2010
Springer
15 years 5 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...