Sciweavers

339 search results - page 10 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
IPPS
1998
IEEE
15 years 1 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
CPHYSICS
2006
204views more  CPHYSICS 2006»
14 years 9 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
BMVC
2010
14 years 7 months ago
Deterministic Sample Consensus with Multiple Match Hypotheses
RANSAC (Random Sample Consensus) is a popular and effective technique for estimating model parameters in the presence of outliers. Efficient algorithms are necessary for both fram...
Paul McIlroy, Edward Rosten, Simon Taylor, Tom Dru...
SPAA
1993
ACM
15 years 1 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 8 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier