Sciweavers

2 search results - page 1 / 1
» Stochastic Node Caching for Memory-bounded Search
Sort
View
IJCAI
2007
15 years 14 days ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
44
Voted
AAAI
1998
15 years 12 days ago
Stochastic Node Caching for Memory-bounded Search
Teruhisa Miura, Toru Ishida