Sciweavers

20638 search results - page 107 / 4128
» Network Computing
Sort
View
IPPS
1998
IEEE
14 years 14 days ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
PODC
1999
ACM
14 years 16 days ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
14 years 20 days ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna
COMCOM
2007
100views more  COMCOM 2007»
13 years 8 months ago
Using the vulnerability information of computer systems to improve the network security
In these years, the security problem becomes more important to everyone using computers. However, vulnerabilities on computers are found so frequently that system managers can not...
Yeu-Pong Lai, Po-Lun Hsia
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 1 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman