Sciweavers

3096 search results - page 230 / 620
» Theory and Use of the EM Algorithm
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 1 days ago
Harmony search for structural design
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
Zong Woo Geem, Kang Seok Lee, Chung-Li Tseng
ISCI
1998
139views more  ISCI 1998»
15 years 6 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan
COMPGEOM
2010
ACM
15 years 11 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 21 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
ICASSP
2010
IEEE
15 years 6 months ago
Hierarchical dictionary learning for invariant classification
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
Leah Bar, Guillermo Sapiro