Sciweavers

ICDE
2012
IEEE
252views Database» more  ICDE 2012»
12 years 1 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— 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 ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
AIPS
2011
13 years 3 months ago
Directed Search for Generalized Plans Using Classical Planners
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...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
EOR
2000
115views more  EOR 2000»
13 years 11 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
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...
Keld Helsgaun
TKDE
2008
121views more  TKDE 2008»
13 years 11 months ago
Schema Matching Using Interattribute Dependencies
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...
Jaewoo Kang, Jeffrey F. Naughton
ALGORITHMICA
2008
78views more  ALGORITHMICA 2008»
13 years 11 months ago
Optimally Adaptive Integration of Univariate Lipschitz Functions
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...
Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
IJCAI
1997
14 years 23 days ago
Automatic Generation of Heuristics for Scheduling
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...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...
AIPS
2003
14 years 25 days ago
Expressive Equivalence of Formalisms for Planning with Sensing
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
Jussi Rintanen
CATA
2004
14 years 25 days ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
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...
Fred J. Rispoli, Steven Cosares
AAAI
2004
14 years 25 days ago
Space-Efficient Memory-Based Heuristics
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...
Rong Zhou, Eric A. Hansen
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 3 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
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...
Javier G. Marín-Blázquez, Sonia Schu...