Sciweavers

14548 search results - page 429 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICAC
2007
IEEE
15 years 11 months ago
Evaluation of Optimization Methods for Network Bottleneck Diagnosis
We consider the problem of localizing network performance bottlenecks and evaluate how various optimization techniques developed for reconstructing link delays perform on this dec...
Alina Beygelzimer, Jeffrey O. Kephart, Irina Rish
TC
2008
15 years 7 months ago
Efficient Approximate Wordlength Optimization
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
Paul D. Fiore
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
JAIR
2008
104views more  JAIR 2008»
15 years 7 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
ISCI
2008
159views more  ISCI 2008»
15 years 7 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao