Sciweavers

1823 search results - page 208 / 365
» Distributed lossy averaging
Sort
View
PDP
2005
IEEE
16 years 21 hour ago
Memory Bandwidth Aware Scheduling for SMP Cluster Nodes
Clusters of SMPs are becoming increasingly common. However, the shared memory design of SMPs and the consequential contention between system processors for access to main memory c...
Evangelos Koukis, Nectarios Koziris
ASIAN
2005
Springer
150views Algorithms» more  ASIAN 2005»
15 years 12 months ago
ACB-R: An Adaptive Clustering-Based Data Replication Algorithm on a P2P Data-Store
Replication on geographically distributed, unreliable, P2P interconnecting nodes can offer high data availability and low network latency for replica access. The challenge is how ...
Junhu Zhang, Dongqing Yang, Shiwei Tang
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
15 years 12 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
CAAN
2004
Springer
15 years 12 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
15 years 12 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking