Sciweavers

23557 search results - page 4252 / 4712
» Distributed Computing - Introduction
Sort
View
126
Voted
NIPS
2003
15 years 6 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
OPODIS
2003
15 years 6 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
120
Voted
OPODIS
2003
15 years 6 months ago
Transformations for Write-All-with-Collision Model
Dependable properties such as self-stabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed ...
Sandeep S. Kulkarni, Umamaheswaran Arumugam
PDPTA
2003
15 years 6 months ago
Distop: A Low-Overhead Cluster Monitoring System
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...
Daniel Andresen, Nathan Schopf, Ethan Bowker, Timo...
AAAI
2000
15 years 6 months ago
Making Rational Decisions Using Adaptive Utility Elicitation
Rational decision making requires full knowledge of the utility function of the person affected by the decisions. However, in many cases, the task of acquiring such knowledge is n...
Urszula Chajewska, Daphne Koller, Ronald Parr
« Prev « First page 4252 / 4712 Last » Next »