Sciweavers

18306 search results - page 34 / 3662
» Algorithmics in Exponential Time
Sort
View
HYBRID
2010
Springer
14 years 2 months ago
Timed automata with observers under energy constraints
In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Ni...
ACISP
2009
Springer
14 years 11 days ago
Random Order m-ary Exponentiation
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
Michael Tunstall
JMLR
2010
137views more  JMLR 2010»
13 years 2 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 7 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
AE
1997
Springer
13 years 12 months ago
An Analysis of Punctuated Equilibria in Simple Genetic Algorithms
In the running of a genetic algorithm, the population is liable to be con ned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a l...
Sang-Yeop Oh, Hyunsoo Yoon