Sciweavers

15485 search results - page 397 / 3097
» Computing Optimal Subsets
Sort
View
ICNC
2005
Springer
16 years 29 days ago
A Game-Theoretic Approach for Designing Mixed Mutation Strategies
Abstract. Different mutation operators have been proposed in evolutionary programming. However, each operator may be efficient in solving a subset of problems, but will fail in an...
Jun He, Xin Yao
FOSSACS
2004
Springer
16 years 25 days ago
On Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
Oded Maler, Amir Pnueli
ICCS
2004
Springer
16 years 25 days ago
Designing Digital Circuits for the Knapsack Problem
Abstract. Multi Expression Programming (MEP) is a Genetic Programming variant that uses linear chromosomes for solution encoding. A unique feature of MEP is its ability of encoding...
Mihai Oltean, Crina Grosan, Mihaela Oltean
IDEAL
2004
Springer
16 years 24 days ago
Wrapper for Ranking Feature Selection
We propose a new feature selection criterion not based on calculated measures between attributes, or complex and costly distance calculations. Applying a wrapper to the output of a...
Roberto Ruiz, Jesús S. Aguilar-Ruiz, Jos&ea...
ICDAR
2003
IEEE
16 years 22 days ago
Vectorization with the Voronoi L-diagram
A new precision vectorization method has been developed for building centerlines of plain shapes. First a dense skeleton is computed. Centerlines are obtained as a subset of branc...
Alexander Gribov, Eugene Bodansky