Sciweavers

231 search results - page 14 / 47
» Selection of Optimal Rule Refinements
Sort
View
PPSN
2010
Springer
13 years 5 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
DASFAA
2003
IEEE
146views Database» more  DASFAA 2003»
14 years 28 days ago
Cost-Driven Storage Schema Selection for XML
Various models and approaches have been proposed for mapping XML data into relational tables recently. Most of those approaches produce relational schema for given XML data, based...
Shihui Zheng, Ji-Rong Wen, Hongjun Lu
ICDAR
2007
IEEE
14 years 1 months ago
K-Nearest Oracle for Dynamic Ensemble Selection
For handwritten pattern recognition, multiple classifier system has been shown to be useful in improving recognition rates. One of the most important issues to optimize a multipl...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
VLDB
1987
ACM
104views Database» more  VLDB 1987»
13 years 11 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
BMCBI
2006
101views more  BMCBI 2006»
13 years 7 months ago
Predicting residue contacts using pragmatic correlated mutations method: reducing the false positives
Background: Predicting residues' contacts using primary amino acid sequence alone is an important task that can guide 3D structure modeling and can verify the quality of the ...
Petras J. Kundrotas, Emil Alexov