7006 search results - page 326 / 1402 » Approximation Algorithms |
114
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
128
click to vote
CASC
2009
Springer
15 years 10 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
143
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
128
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
114
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...