ICDE
2012
IEEE
12 years 1 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
AIPS
2011
13 years 2 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
EOR
2000
13 years 10 months ago
2000
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
TKDE
2008
13 years 10 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
ALGORITHMICA
2008
13 years 11 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
IJCAI
1997
14 years 6 days ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
AIPS
2003
14 years 8 days ago
2003
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
CATA
2004
14 years 8 days ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
AAAI
2004
14 years 8 days ago
2004
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...