Sciweavers

225 search results - page 1 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
ICDCS
2005
IEEE
13 years 9 months ago
Explicit Combinatorial Structures for Cooperative Distributed Algorithms
Dariusz R. Kowalski, Peter M. Musial, Alexander A....
SPIN
2004
Springer
13 years 9 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
13 years 10 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
COMPGEOM
2003
ACM
13 years 9 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
IROS
2006
IEEE
105views Robotics» more  IROS 2006»
13 years 9 months ago
Combinatorial Optimization of Sensing for Rule-Based Planar Distributed Assembly
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
Jonathan Kelly, Hong Zhang