3020 search results - page 86 / 604 » Optimal partition trees |
164
Voted
JMLR
2010
15 years 27 days ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
174
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
187
Voted
BROADNETS
2006
IEEE
16 years 5 days ago
2006
IEEE
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
159
click to vote
UAI
2008
15 years 7 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
162
click to vote
IESS
2007
Springer
16 years 8 days ago
2007
Springer
: Hardware/software partitioning moves software kernels from a microprocessor to custom hardware accelerators. We consider advanced implementation options for accelerators, greatly...