Sciweavers

263 search results - page 16 / 53
» Path partitions of hypercubes
Sort
View
ICRA
2009
IEEE
116views Robotics» more  ICRA 2009»
13 years 6 months ago
Multi-vehicle path coordination in support of communication
Abstract-- This paper presents a framework for generating time-optimal velocity profiles for a group of pathconstrained vehicle robots that have fixed and known initial and goal lo...
Pramod Abichandani, Hande Y. Benson, Moshe Kam
FOCS
2002
IEEE
14 years 1 months ago
Minimizing Congestion in General Networks
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
Harald Räcke
JGT
2008
59views more  JGT 2008»
13 years 8 months ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
IPL
2007
87views more  IPL 2007»
13 years 8 months ago
The forwarding indices of augmented cubes
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
Min Xu, Jun-Ming Xu
INFOCOM
2000
IEEE
14 years 25 days ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt