Sciweavers

263 search results - page 24 / 53
» Path partitions of hypercubes
Sort
View
ISPAN
2005
IEEE
14 years 2 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
JGT
2010
93views more  JGT 2010»
13 years 6 months ago
An asymptotic version of a conjecture by Enomoto and Ota
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Colton Magnant, Daniel M. Martin
ICIP
2004
IEEE
14 years 10 months ago
Overlay multi-hop fec scheme for video streaming over peer-to-peer networks
Overlay networks offer promising capabilities for video streaming, due to their support for application-layer processing at the overlay forwarding nodes. In this paper we propose ...
Yufeng Shan, Ivan V. Bajic, Shivkumar Kalyanaraman...
ICRA
2010
IEEE
161views Robotics» more  ICRA 2010»
13 years 7 months ago
DisCoverage: A new paradigm for multi-robot exploration
— The main aspect in multi-robot exploration is the efficient coordination of a group of robots. Inspired by previous results on the coverage problem, we propose a novel, fronti...
A. Dominik Haumann, Kim D. Listmann, Volker Willer...
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 3 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry