Sciweavers

8080 search results - page 360 / 1616
» Distributed Constrained Optimization
Sort
View
SPAA
1996
ACM
15 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 11 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
EDBT
2006
ACM
105views Database» more  EDBT 2006»
16 years 7 months ago
HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
Xiaohui Yu, Nick Koudas, Calisto Zuzarte
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 8 months ago
Comparison of cauchy EDA and rosenbrock's algorithms on the BBOB noiseless testbed
Estimation-of-distribution algorithm equipped with Cauchy distribution (Cauchy EDA) is compared with Rosenbrock’s local search algorithm. Both algorithms were already presented ...
Petr Posík
176
Voted
GECCO
2010
Springer
177views Optimization» more  GECCO 2010»
15 years 8 months ago
Comparison of cauchy EDA and G3PCX algorithms on the BBOB noiseless testbed
Estimation-of-distribution algorithm equipped with Cauchy sampling distribution is compared with the generalized generation gap algorithm with parent centric crossover. Both algor...
Petr Posík