Sciweavers

5580 search results - page 231 / 1116
» Randomized priority algorithms
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
16 years 3 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
IPPS
1998
IEEE
15 years 10 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
16 years 3 days ago
Resolution Scalable Coding and Region of Interest Access with Three-Dimensional SBHP Algorithm
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
Ying Liu, William A. Pearlman
CCCG
2009
15 years 7 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner