1456 search results - page 141 / 292 » Improved Randomized Results for That Interval Selection Prob... |
TCS
2008
14 years 11 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
PADS
1999
ACM
15 years 3 months ago
1999
ACM
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
IDEAL
2000
Springer
15 years 2 months ago
2000
Springer
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
ALGOSENSORS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
129
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...