500 search results - page 26 / 100 » A parallel quadratic programming method for dynamic optimiza... |
134
Voted
IEEEPACT
2000
IEEE
15 years 7 months ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
143
Voted
PDPTA
2000
15 years 4 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
110
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
125
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
212
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...