Sciweavers

12519 search results - page 25 / 2504
» Approximation Problems Categories
Sort
View
DAC
2009
ACM
16 years 23 days ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 6 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
15 years 3 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
COMPGEOM
2010
ACM
15 years 4 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park