5153 search results - page 44 / 1031 » Introduction to Randomized Algorithms |
218
click to vote
STOC
1994
ACM
15 years 10 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...
140
click to vote
SPAA
1993
ACM
15 years 10 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.
167
click to vote
CSDA
2010
15 years 6 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...
161
click to vote
INFOCOM
2007
IEEE
16 years 6 days 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...