2767 search results - page 258 / 554 » Universal Exponentiation Algorithm |
177
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
168
click to vote
ADBIS
1998
Springer
15 years 10 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
141
click to vote
ISMVL
1997
IEEE
15 years 10 months ago
1997
IEEE
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
140
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
178
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...