Sciweavers

327 search results - page 7 / 66
» Algorithms for infinite huffman-codes
Sort
View
FORMATS
2007
Springer
13 years 11 months ago
CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov c...
Anne Remke, Boudewijn R. Haverkort
MOC
2002
118views more  MOC 2002»
13 years 7 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
13 years 8 months ago
Algorithms for infinite huffman-codes
Mordecai J. Golin, Kin Keung Ma
JSC
2008
55views more  JSC 2008»
13 years 7 months ago
Algorithms for a class of infinite permutation groups
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m...
Stefan Kohl
NIPS
2008
13 years 8 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos