Sciweavers

1205 search results - page 139 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
1996
IEEE
14 years 2 months ago
Implementing the Data Diffusion Machine Using Crossbar Routers
The Data Diffusion Machine is a scalable virtual shared memory architecture. A hierarchical network is used to ensure that all data can be located in a time bounded by O(logp), wh...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...
IFIP
2004
Springer
14 years 3 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
13 years 11 months ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo
DM
2007
83views more  DM 2007»
13 years 10 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
IPPS
2008
IEEE
14 years 4 months ago
PROD: Relayed file retrieving in overlay networks
— To share and exchange the files among Internet users, Peerto-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P fil...
Zhiyong Xu, D. Stefanescu, Honggang Zhang, Laxmi N...