Sciweavers

9842 search results - page 22 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 11 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
JMM2
2008
124views more  JMM2 2008»
13 years 7 months ago
Integrated Feature Selection and Clustering for Taxonomic Problems within Fish Species Complexes
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
Huimin Chen, Henry L. Bart Jr., Shuqing Huang
TSMC
2002
80views more  TSMC 2002»
13 years 7 months ago
Performance metric alerting: a new design approach for complex alerting problems
Alerting systems and related decision-making automation are widely used to enhance the safety and capability of controlled processes across many applications. Traditional alerting ...
L. C. Yang, J. K. Kuchar
FOCS
1998
IEEE
13 years 11 months ago
Which Problems Have Strongly Exponential Complexity?
Russell Impagliazzo, Ramamohan Paturi, Francis Zan...
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of the Approximation of the Bandwidth Problem
d Abstract) Walter Unger Lehrstuhl f
Walter Unger