Sciweavers

6562 search results - page 131 / 1313
» Noetherianity and Combination Problems
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
15 years 4 months ago
Evaluation of entity resolution approaches on real-world match problems
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
Hanna Köpcke, Andreas Thor, Erhard Rahm
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 7 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
PDCN
2004
15 years 7 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
COR
2008
142views more  COR 2008»
15 years 5 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
HPCA
1998
IEEE
15 years 10 months ago
FPGA Based Custom Computing Machines for Irregular Problems
Over the past few years there has been increased interest in building custom computing machines (CCMs) as a way of achieving very high performance on specific problems. The advent...
David Abramson, Paul Logothetis, Adam Postula, Mar...