Sciweavers

1403 search results - page 39 / 281
» About Approximations of Exponentials
Sort
View
74
Voted
SIAMNUM
2010
106views more  SIAMNUM 2010»
14 years 7 months ago
Computing Sacker-Sell spectra in Discrete Time Dynamical Systems
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
Thorsten Hüls
120
Voted
ATAL
2007
Springer
15 years 6 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
FOCS
2006
IEEE
15 years 6 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
96
Voted
AAAI
1994
15 years 2 months ago
Temporal Reasoning with Constraints on Fluents and Events
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
Eddie Schwalb, Kalev Kask, Rina Dechter
69
Voted
CPC
2010
122views more  CPC 2010»
15 years 23 days ago
The Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
Louigi Addario-Berry, Nicolas Broutin, Gábo...