Sciweavers

7150 search results - page 300 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
WWW
2004
ACM
16 years 7 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
16 years 1 days ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
ICML
2008
IEEE
16 years 7 months ago
An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning
We show that linear value-function approximation is equivalent to a form of linear model approximation. We then derive a relationship between the model-approximation error and the...
Ronald Parr, Lihong Li, Gavin Taylor, Christopher ...
IPCO
2008
129views Optimization» more  IPCO 2008»
15 years 8 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
16 years 25 days ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...