Sciweavers

602 search results - page 81 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
ICSM
1999
IEEE
14 years 3 months ago
Bunch: A Clustering Tool for the Recovery and Maintenance of Software System Structures
Software systems are typically modified in order to extend or change their functionality, improve their performance, port them to different platforms, and so on. For developers, i...
Spiros Mancoridis, Brian S. Mitchell, Yih-Farn Che...
RECOMB
2009
Springer
14 years 5 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 2 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 11 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
SIAMJO
2008
100views more  SIAMJO 2008»
13 years 11 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...