Sciweavers

113 search results - page 18 / 23
» Data structures with dynamical random transitions
Sort
View
IRREGULAR
1997
Springer
14 years 3 months ago
Parallel Shared-Memory State-Space Exploration in Stochastic Modeling
Stochastic modeling forms the basis for analysis in many areas, including biological and economic systems, as well as the performance and reliability modeling of computers and comm...
Susann C. Allmaier, Graham Horton
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
14 years 4 months ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec
FLAIRS
2004
14 years 7 days ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
INFOCOM
2000
IEEE
14 years 3 months ago
Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...
Ben Liang, Zygmunt J. Haas
IPPS
2010
IEEE
13 years 8 months ago
Parallelization of tau-leap coarse-grained Monte Carlo simulations on GPUs
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
Lifan Xu, Michela Taufer, Stuart Collins, Dionisio...