Sciweavers

402 search results - page 67 / 81
» Probability, Parallelism and the State Space Exploration Pro...
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
PPOPP
2005
ACM
14 years 1 months ago
Scaling model checking of dataraces using dynamic information
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
Ohad Shacham, Mooly Sagiv, Assaf Schuster
IOR
2008
91views more  IOR 2008»
13 years 7 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
SIGGRAPH
1997
ACM
14 years 2 days ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
DAGSTUHL
1998
13 years 9 months ago
Markov Localization for Reliable Robot Navigation and People Detection
Localization is one of the fundamental problems in mobile robotics. Without knowledge about their position mobile robots cannot e ciently carry out their tasks. In this paper we pr...
Dieter Fox, Wolfram Burgard, Sebastian Thrun