Sciweavers

6437 search results - page 468 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IPPS
2006
IEEE
16 years 1 months ago
Comparative study of price-based resource allocation algorithms for ad hoc networks
As mobile ad hoc networks provide a wide range of possibly critical services, providing quality of service guarantees becomes an essential element. Yet there is a limited understa...
Marcel Lüthi, Simin Nadjm-Tehrani, Calin Cure...
ISPAN
2005
IEEE
16 years 1 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
PDP
2002
IEEE
16 years 17 days ago
A Parametrized Algorithm that Implements Sequential, Causal, and Cache Memory Consistency
In this paper we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it has a ...
Ernesto Jiménez, Antonio Fernández, ...
SPAA
2010
ACM
16 years 14 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
IPPS
1998
IEEE
15 years 12 months ago
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu