Sciweavers

1576 search results - page 43 / 316
» Properties of Synthetic Optimization Problems
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
The Cache Inference Problem and its Application to Content and Request Routing
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
Nikolaos Laoutaris, Georgios Zervas, Azer Bestavro...
SADM
2008
178views more  SADM 2008»
13 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ICDCS
2007
IEEE
14 years 4 months ago
AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems
This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where host...
Ramsés Morales, Indranil Gupta
PC
2011
314views Management» more  PC 2011»
13 years 4 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...
WSC
2001
13 years 11 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin