226 search results - page 22 / 46 » Dynamic Variable Ordering in CSPs |
117
click to vote
JAIR
2000
15 years 2 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
120
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
129
click to vote
CP
2008
Springer
15 years 4 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
125
click to vote
JCNS
2010
14 years 10 months ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
116
click to vote
EOR
2006
15 years 3 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...