Sciweavers

86 search results - page 12 / 18
» soda 2004
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 11 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
14 years 11 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
14 years 11 months ago
An exact subexponential-time lattice algorithm for Asian options
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
Tian-Shyr Dai, Yuh-Dauh Lyuu
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
14 years 11 months ago
A maiden analysis of Longest Wait First
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
Jeff Edmonds, Kirk Pruhs
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
14 years 11 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...