Sciweavers

7006 search results - page 542 / 1402
» Approximation Algorithms
Sort
View
COMGEO
2007
ACM
15 years 6 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
SIAMCO
2000
71views more  SIAMCO 2000»
15 years 6 months ago
On a Perturbation Approach for the Analysis of Stochastic Tracking Algorithms
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
Rafik Aguech, Eric Moulines, Pierre Priouret
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 6 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
ISCA
2011
IEEE
273views Hardware» more  ISCA 2011»
14 years 10 months ago
Bypass and insertion algorithms for exclusive last-level caches
Inclusive last-level caches (LLCs) waste precious silicon estate due to cross-level replication of cache blocks. As the industry moves toward cache hierarchies with larger inner l...
Jayesh Gaur, Mainak Chaudhuri, Sreenivas Subramone...
PPOPP
2011
ACM
14 years 9 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...