1449 search results - page 26 / 290 » Self-Randomized Exponentiation Algorithms |
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
66
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
101
click to vote
STOC
1991
ACM
15 years 4 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
103
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Exponential Family PSR (EFPSR) models capture stochastic dynamical systems by representing state as the parameters of an exponential family distribution over a shortterm window of...
102
click to vote
JC
2007
15 years 11 days ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...