Sciweavers

603 search results - page 96 / 121
» DFS-Tree Based Heuristic Search
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 7 days ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
VLDB
1990
ACM
128views Database» more  VLDB 1990»
14 years 4 days ago
Advanced Query Processing in Object Bases Using Access Support Relations
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...
Alfons Kemper, Guido Moerkotte
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 2 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
IJCAI
2007
13 years 9 months ago
Domain Independent Approaches for Finding Diverse Plans
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevin...
ISMB
2004
13 years 9 months ago
Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy
Motivation: Non-coding RNAs (ncRNAs)--functional RNA molecules not coding for proteins--are grouped into hundreds of families of homologs. To find new members of an ncRNA gene fam...
Zasha Weinberg, Walter L. Ruzzo