Sciweavers

867 search results - page 125 / 174
» The Generalized Maximum Coverage Problem
Sort
View
SLIP
2009
ACM
14 years 2 months ago
Integrated interlayer via planning and pin assignment for 3D ICs
As technology advances, 3D ICs are introduced for alleviating the interconnect problem coming with shrinking feature size and increasing integration density. In 3D ICs, one of the...
Xu He, Sheqin Dong, Xianlong Hong, Satoshi Goto
GECCO
2005
Springer
170views Optimization» more  GECCO 2005»
14 years 1 months ago
Multiobjective shape optimization with constraints based on estimation distribution algorithms and correlated information
A new approach based on Estimation Distribution Algorithms for constrained multiobjective shape optimization is proposed in this article. Pareto dominance and feasibility rules ar...
Sergio Ivvan Valdez Peña, Salvador Botello ...
SAC
2004
ACM
14 years 1 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
PODS
2010
ACM
207views Database» more  PODS 2010»
14 years 29 days ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
MFCS
2009
Springer
14 years 14 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...