7930 search results - page 425 / 1586 » Greedy in Approximation Algorithms |
191
click to vote
TEC
2002
15 years 6 months ago
2002
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
196
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
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 ...
190
click to vote
ISAAC
2004
Springer
16 years 6 days ago
2004
Springer
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...
192
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
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...
186
click to vote
JCO
2010
15 years 5 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...