566 search results - page 39 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
117
Voted
AAAI
2007
15 years 2 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
87
Voted
RECOMB
2004
Springer
16 years 23 days ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
100
click to vote
EUROGP
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
131
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
128
Voted
CP
2011
Springer
14 years 8 days ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...