Sciweavers

5580 search results - page 109 / 1116
» Randomized priority algorithms
Sort
View
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
15 years 3 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
15 years 11 months ago
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
David Gamarnik, David Goldberg, Theophane Weber
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
15 years 7 months ago
Computationally Private Randomizing Polynomials and Their Applications
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
IWDC
2001
Springer
101views Communications» more  IWDC 2001»
15 years 6 months ago
Resource Stealing in Endpoint Controlled Multi-class Networks
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...
Susana Sargento, Rui Valadas, Edward W. Knightly