Sciweavers

4670 search results - page 298 / 934
» Testing that distributions are close
Sort
View
DEBS
2003
ACM
15 years 12 months ago
A peer-to-peer approach to content-based publish/subscribe
Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the desi...
Wesley W. Terpstra, Stefan Behnel, Ludger Fiege, A...
GECCO
2003
Springer
15 years 12 months ago
Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold
We identify classes of functions for which a No Free Lunch result does and does not hold, with particular emphasis on the relationship between No Free Lunch and problem description...
Matthew J. Streeter
ISHPC
2003
Springer
15 years 12 months ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
IEEEPACT
2002
IEEE
15 years 11 months ago
Efficient Interconnects for Clustered Microarchitectures
Clustering is an effective microarchitectural technique for reducing the impact of wire delays, the complexity, and the power requirements of microprocessors. In this work, we inv...
Joan-Manuel Parcerisa, Julio Sahuquillo, Antonio G...
155
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
Probabilistic Location and Routing
Abstract—We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists cl...
Sean C. Rhea, John Kubiatowicz