Sciweavers

2750 search results - page 471 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
STTT
2008
162views more  STTT 2008»
15 years 6 months ago
Coping with large design spaces: design problem solving in fluidic engineering
Abstract This paper is about tool support for knowledgeintensive engineering tasks. In particular, it introduces software technology to assist the design of complex technical syste...
Benno Stein
TCS
2008
15 years 6 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
TEC
2008
104views more  TEC 2008»
15 years 6 months ago
Coevolution of Fitness Predictors
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
Michael D. Schmidt, Hod Lipson
TNN
2008
97views more  TNN 2008»
15 years 6 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
Liefeng Bo, Ling Wang, Licheng Jiao
CCE
2005
15 years 6 months ago
Selecting maximally informative genes
Microarray experiments are emerging as one of the main driving forces in modern biology. By allowing the simultaneous monitoring of the expression of the entire genome for a given...
Ioannis P. Androulakis