Sciweavers

2694 search results - page 183 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
ICDCS
2007
IEEE
16 years 14 days ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
EMO
2001
Springer
209views Optimization» more  EMO 2001»
15 years 10 months ago
Comparison of Evolutionary and Deterministic Multiobjective Algorithms for Dose Optimization in Brachytherapy
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
Natasa Milickovic, Michael Lahanas, Dimos Baltas, ...
216
Voted
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 8 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
15 years 7 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...