Sciweavers

4642 search results - page 48 / 929
» Distributed algorithm and reversible network
Sort
View
WDAG
1994
Springer
123views Algorithms» more  WDAG 1994»
14 years 2 days ago
Breakpoints and Time in Distributed Computations
This paper investigates how vector time can be used to set breakpoints in distributed computations for the purpose of analyzing and debugging distributed programs. A breakpoint is ...
Twan Basten
ASE
2007
143views more  ASE 2007»
13 years 8 months ago
Composition inference for UML class diagrams
Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the ga...
Ana Milanova
SPDP
1991
IEEE
13 years 11 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
TWC
2008
93views more  TWC 2008»
13 years 7 months ago
A Distributed Subset Selection Algorithm for a Set of Mobile Links with Power Control
The capacity of a power controlled wireless network can be changing due to user's mobility, fading or shadowing effects. As a result, the quality of service (QOS) of all users...
Chun-Chia Chen, Duan-Shin Lee
INFOCOM
1999
IEEE
14 years 9 days ago
CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bhargh...