Sciweavers

640 search results - page 119 / 128
» Learning Programs in Different Paradigms using Genetic Progr...
Sort
View
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 7 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
IPPS
2003
IEEE
14 years 23 days ago
SPMD Image Processing on Beowulf Clusters: Directives and Libraries
Most image processing algorithms can be parallelized by splitting parallel loops and by using very few communication patterns. Code parallelization using MPI still involves much p...
Paulo F. Oliveira, J. M. Hans du Buf
IIE
2007
73views more  IIE 2007»
13 years 7 months ago
Exploiting Open-source Projects to Study Software Design
This article presents an approach to using open-source tools and open-source projects to add realistic and practical examples to a course on software design in a professional maste...
Christopher P. Fuhrman
PROMISE
2010
13 years 2 months ago
Replication of defect prediction studies: problems, pitfalls and recommendations
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
Thilo Mende