Sciweavers

45 search results - page 7 / 9
» sirocco 2007
Sort
View
SIROCCO
2000
14 years 11 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
SIROCCO
1997
14 years 11 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
SIROCCO
2001
14 years 11 months ago
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
An Interval Routing Scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assig...
Yashar Ganjali
SIROCCO
2007
14 years 11 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
SIROCCO
2007
14 years 11 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...