Sciweavers

418 search results - page 71 / 84
» Optimal Topology Design for Overlay Networks
Sort
View
ICAC
2006
IEEE
14 years 1 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
AINA
2007
IEEE
14 years 2 months ago
Reference Path Ad Hoc Routing Mechanism
The purpose of this work is to present the Reference Path Ad hoc Routing (REPAR) mechanism, which has been designed to optimize the performance of reactive ad hoc routing protocol...
Fabricio L. Figueiredo, Paulo Cardieri, Marcel C. ...
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 7 months ago
Safe cooperative robot dynamics on graphs
This paper initiates the use of vector fields to design, optimize, and implement reactive schedules for safe cooperative robot patterns on planar graphs. We consider Automated Gui...
Robert Ghrist, Daniel E. Koditschek
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 14 days ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
IWCMC
2006
ACM
14 years 1 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan