377 search results - page 56 / 76 » Discrete stochastic optimization using linear interpolation |
150
click to vote
JMLR
2010
14 years 12 months 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, ...
136
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
183
click to vote
ICCSA
2003
Springer
15 years 10 months ago
2003
Springer
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
150
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
182
click to vote
DCG
2008
15 years 5 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...