603 search results - page 96 / 121 » DFS-Tree Based Heuristic Search |
149
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
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...
132
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
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...
170
click to vote
GECCO
2007
Springer
16 years 2 days ago
2007
Springer
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...
141
click to vote
IJCAI
2007
15 years 7 months ago
2007
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...
146
click to vote
ISMB
2004
15 years 7 months ago
2004
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...