3049 search results - page 181 / 610 » On the Convergence of Bound Optimization Algorithms |
191
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
208
click to vote
DMTCS
2010
15 years 3 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
157
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by parallel optimization, we experiment EDA-like adaptation-rules in the case of λ large. The rule we use, essentially based on estimation of multivariate normal algorit...
146
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
176
click to vote
ISQED
2005
IEEE
16 years 1 days ago
2005
IEEE
Hierarchical approach greatly facilitates large-scale chip design by hiding distracting details in low-level objects. However, the lowlevel designs have to have a global view of h...