500 search results - page 83 / 100 » A Sample Approximation Approach for Optimization with Probab... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
TOG
2010
13 years 2 months ago
2010
This paper introduces a method for optimizing the tiles of a quadmesh. Given a quad-based surface, the goal is to generate a set of K quads whose instances can produce a tiled sur...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...