Sciweavers

1541 search results - page 138 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
140
Voted
STACS
2005
Springer
15 years 10 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 10 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
129
Voted
GECCO
2004
Springer
15 years 10 months ago
On the Choice of the Population Size
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
Tobias Storch
AC
2003
Springer
15 years 10 months ago
Concentration Inequalities
Concentration inequalities deal with deviations of functions of independent random variables from their expectation. In the last decade new tools have been introduced making it pos...
Stéphane Boucheron, Gábor Lugosi, Ol...
COCOA
2008
Springer
15 years 6 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz