566 search results - page 91 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
113
click to vote
RTSS
2007
IEEE
15 years 6 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
111
click to vote
AAAI
1998
15 years 1 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
115
click to vote
AOSE
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The agent-oriented approach has been successfully applied to the solution of complex problems in dynamic open environments. However, to extend its use to mainstream compu...
112
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
Although more efficient in computation compared to other tracking approaches such as particle filtering, the kernel-based tracking suffers from the "singularity" problem...
104
click to vote
CORR
2006
Springer
15 years 12 days ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...