5153 search results - page 44 / 1031 » Introduction to Randomized Algorithms |
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
121
click to vote
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
CSDA
2010
14 years 9 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...