Sciweavers

2303 search results - page 268 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
SPAA
1994
ACM
15 years 8 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
GPC
2010
Springer
15 years 8 months ago
Actor Garbage Collection Using Vertex-Preserving Actor-to-Object Graph Transformations
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
Wei-Jen Wang, Carlos A. Varela, Fu-Hau Hsu, Cheng-...
CONCUR
2010
Springer
15 years 5 months ago
A Theory of Design-by-Contract for Distributed Multiparty Interactions
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Y...
CCGRID
2008
IEEE
15 years 10 months ago
On the Optimization of Resource Utilization in Distributed Multimedia Applications
—The application and research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and...
R. Yang, Robert D. van der Mei, D. Roubos, Frank J...
PPSN
2000
Springer
15 years 8 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...