944 search results - page 79 / 189 » Heuristic Search for Large Problems With Real Costs |
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form ...
IS
2007
14 years 10 months ago
2007
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
122
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...