Sciweavers

332 search results - page 56 / 67
» Hypercubic Sorting Networks
Sort
View
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
NETGAMES
2006
ACM
14 years 1 months ago
A new approach on wearable game design and its evaluation
As technologies evolve and computer systems shrink to the size of matchboxes, also their field of application shifts in new directions. Our permanent companions, mobile phones, p...
Christian Bertelsmeyer, Erik Koch, Alexander H. Sc...
MWCN
2004
Springer
14 years 1 months ago
Route Stability Techniques for Enhanced Video Delivery on Manets
Abstract One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause interrup...
Carlos Miguel Tavares Calafate, Manuel P. Malumbre...
ATAL
2003
Springer
14 years 26 days ago
Self-Organization in Multi Agent Systems: A Middleware Approach
Self-organization is built upon two main building blocks: adaptive and uncoupled interaction mechanisms and context-awareness. Here we show how the middleware TOTA (Tuples On The ...
Marco Mamei, Franco Zambonelli
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 11 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...