Sciweavers

1806 search results - page 218 / 362
» Randomness and halting probabilities
Sort
View
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
15 years 11 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
FUN
2010
Springer
306views Algorithms» more  FUN 2010»
15 years 11 months ago
Leveling-Up in Heroes of Might and Magic III
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
Dimitrios I. Diochnos
CDC
2009
IEEE
104views Control Systems» more  CDC 2009»
15 years 11 months ago
Moment-based analysis of synchronization in small-world networks of oscillators
— In this paper, we investigate synchronization in a small-world network of coupled nonlinear oscillators. This network is constructed by introducing random shortcuts in a neares...
Victor M. Preciado, Ali Jadbabaie
EUROPAR
2009
Springer
15 years 11 months ago
Modeling Resubmission in Unreliable Grids: The Bottom-Up Approach
Abstract. Failure is an ordinary characteristic of large-scale distributed environments. Resubmission is a general strategy employed to cope with failures in grids. Here, we analyt...
Vandy Berten, Emmanuel Jeannot
FOCS
2000
IEEE
15 years 11 months ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard