Sciweavers

3208 search results - page 399 / 642
» A Lower Bound for Primality
Sort
View
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
15 years 8 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 8 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...
WSC
2001
15 years 8 months ago
A new approach to pricing American-style derivatives
This paper presents a new approach to pricing Americanstyle derivatives. By approximating the value function with a piecewise linear interpolation function, the option holder'...
Scott B. Laprise, Michael C. Fu, Steven I. Marcus,...
PUK
2000
15 years 8 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
AAAI
1996
15 years 8 months ago
Goal Oriented Symbolic Propagation in Bayesian Networks
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
Enrique Castillo, José Manuel Gutiér...