402 search results - page 30 / 81 » Probability, Parallelism and the State Space Exploration Pro... |
AAAI
2008
13 years 10 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
RAS
2010
13 years 6 months ago
2010
Policy Reuse is a reinforcement learning technique that efficiently learns a new policy by using past similar learned policies. The Policy Reuse learner improves its exploration b...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The need to provide performance guarantee in high performance servers has long been neglected. Providing performance guarantee in current and future servers is difficult because ï...
ESCIENCE
2006
IEEE
14 years 2 months ago
2006
IEEE
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...