Sciweavers

7006 search results - page 1051 / 1402
» Approximation Algorithms
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
NIPS
2007
15 years 8 months ago
Reinforcement Learning in Continuous Action Spaces through Sequential Monte Carlo Methods
Learning in real-world domains often requires to deal with continuous state and action spaces. Although many solutions have been proposed to apply Reinforcement Learning algorithm...
Alessandro Lazaric, Marcello Restelli, Andrea Bona...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
VMV
2003
173views Visualization» more  VMV 2003»
15 years 8 months ago
Improved Hardware-Accelerated Visual Hull Rendering
The visual hull is an efficient shape approximation for the purpose of reconstructing and visualizing dynamic objects. Recently, rapid progress in graphics hardware development h...
Ming Li, Marcus A. Magnor, Hans-Peter Seidel
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
15 years 7 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
« Prev « First page 1051 / 1402 Last » Next »