Sciweavers

425 search results - page 75 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
IWCMC
2010
ACM
13 years 9 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
SPAA
1995
ACM
13 years 11 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
EUROPAR
2010
Springer
13 years 8 months ago
Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
Jonathan Mak, Karl-Filip Faxén, Sverker Jan...
POPL
1991
ACM
13 years 11 months ago
Coordinating First-Order Multiparty Interactions
-order multiparty interaction is an abstraction mechanism that defines communication among a set of formal process roles. Actual processes participate in a first-order interactio...
Yuh-Jzer Joung, Scott A. Smolka