Sciweavers

2816 search results - page 539 / 564
» Submodular function minimization
Sort
View
NSDI
2007
14 years 5 days ago
Tesseract: A 4D Network Control Plane
We present Tesseract, an experimental system that enables the direct control of a computer network that is under a single administrative domain. Tesseract’s design is based on t...
Hong Yan, David A. Maltz, T. S. Eugene Ng, Hemant ...
CF
2008
ACM
13 years 12 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
COLT
2008
Springer
13 years 11 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
ETVC
2008
13 years 11 months ago
Statistical Computing on Manifolds: From Riemannian Geometry to Computational Anatomy
Computational anatomy is an emerging discipline that aims at analyzing and modeling the individual anatomy of organs and their biological variability across a population. The goal ...
Xavier Pennec
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 11 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova