Sciweavers

449 search results - page 38 / 90
» Evolutionary Approaches to Linear Ordering Problem
Sort
View
GECCO
1999
Springer
142views Optimization» more  GECCO 1999»
14 years 2 months ago
Towards Byte Code Genetic Programming
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
Brad Harvey, James A. Foster, Deborah A. Frincke
SIAMMAX
2010
123views more  SIAMMAX 2010»
13 years 4 months ago
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
Vladimir Protasov, Raphaël M. Jungers, Vincen...
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
14 years 3 months ago
Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
Shirish Krishnaj Shevade, Wei Chu
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 11 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
PLDI
2004
ACM
14 years 3 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...