Sciweavers

5595 search results - page 714 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 8 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
GLOBECOM
2009
IEEE
16 years 1 months ago
Anonymous Cardinality Estimation in RFID Systems with Multiple Readers
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
Vahid Shah-Mansouri, Vincent W. S. Wong
ICPR
2008
IEEE
16 years 8 months ago
Tailoring text for automatic layouting of newspaper pages
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
Leonhard Hennig, Thomas Strecker
IWPEC
2004
Springer
16 years 6 days ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw
ICIP
1999
IEEE
15 years 11 months ago
Nonlinear Multigrid Optimization for Bayesian Diffusion Tomography
Optical diffusion tomography attempts to reconstruct an object cross section from measurements of scattered and attenuated light. While Bayesian approaches are well suited to this...
Jong Chul Ye, Charles A. Bouman, Rick P. Millane, ...