Sciweavers

547 search results - page 35 / 110
» A Planning Algorithm not based on Directional Search
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 8 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
EUC
2005
Springer
14 years 1 months ago
Dependable Polygon-Processing Algorithms for Safety-Critical Embedded Systems
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
Jens Brandt, Klaus Schneider
EC
2008
146views ECommerce» more  EC 2008»
13 years 7 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
VLDB
2002
ACM
83views Database» more  VLDB 2002»
13 years 7 months ago
Searching on the Secondary Structure of Protein Sequences
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
Laurie Hammel, Jignesh M. Patel
CSMR
2000
IEEE
14 years 6 days ago
Architectural Design Recovery using Data Mining Techniques
This paper presents a technique for recovering the high level design of legacy software systems according to user defined architectural plans. Architectural plans are represented...
Kamran Sartipi, Kostas Kontogiannis, Farhad Mavadd...