Sciweavers

1403 search results - page 1 / 281
» About Approximations of Exponentials
Sort
View
AAECC
1995
Springer
137views Algorithms» more  AAECC 1995»
13 years 8 months ago
About Approximations of Exponentials
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
Pierre-Vincent Koseleff
EUROCRYPT
1999
Springer
13 years 9 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
UAI
1997
13 years 6 months ago
Score and Information for Recursive Exponential Models with Incomplete Data
Recursive graphical models usually underlie the statistical modelling concerning probabilistic expert systems based on Bayesian networks. This paper de nes a version of these mode...
Bo Thiesson
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 8 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
INFOCOM
2011
IEEE
12 years 8 months ago
There's something about MRAI: Timing diversity can exponentially worsen BGP convergence
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...
Alex Fabrikant, Umar Syed, Jennifer Rexford