244 search results - page 19 / 49 » A Linear Search Strategy using Bounds |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
ICGA
1997
13 years 10 months ago
1997
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
PODS
2001
ACM
14 years 8 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...