Sciweavers

1549 search results - page 148 / 310
» Distributed Algorithms for Dynamic Survivability of Multiage...
Sort
View
RIA
2006
60views more  RIA 2006»
15 years 6 months ago
GACS : une approche ascendante pour la coordination spatiale
ABSTRACT. The design of spatial coordination mechanisms for dynamical and continuous multiagent setting is a difficult challenge. While the top-down decomposition approach is ineff...
Fabien Flacher, Olivier Sigaud
CLUSTER
2007
IEEE
16 years 19 days ago
Dynamic scheduling of multi-processor tasks on clusters of clusters
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Sascha Hunold, Thomas Rauber, Gudula Rünger
NCA
2007
IEEE
16 years 17 days ago
Implementing Atomic Data through Indirect Learning in Dynamic Networks
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...
CN
2004
129views more  CN 2004»
15 years 6 months ago
Dynamic traffic controls for Web-server networks
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the...
Liming Liu, Yumao Lu
SPAA
2006
ACM
16 years 7 days ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi