Sciweavers

617 search results - page 120 / 124
» Optimal Distributed Online Prediction using Mini-Batches
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Exploiting scale invariant dynamics for efficient information propagation in large teams
Large heterogeneous teams will often be in situations where sensor data that is uncertain and conflicting is shared across a peer-to-peer network. Not every team member will have ...
Robin Glinton, Paul Scerri, Katia P. Sycara
NSDI
2004
13 years 8 months ago
Consistent and Automatic Replica Regeneration
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
Haifeng Yu, Amin Vahdat
IOR
2002
135views more  IOR 2002»
13 years 7 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 29 days ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
AMAI
2011
Springer
12 years 7 months ago
Multi-armed bandits with episode context
A multi-armed bandit episode consists of n trials, each allowing selection of one of K arms, resulting in payoff from a distribution over [0, 1] associated with that arm. We assum...
Christopher D. Rosin