721 search results - page 110 / 145 » Graphs with Large Obstacle Numbers |
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
EUROPAR
2007
Springer
14 years 3 months ago
2007
Springer
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
— Fault diagnosis of coupled mobile robots requires a large number of measurements to be communicated either between the robots or from the robots to a central diagnoser. As comp...
APCSAC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...