Sciweavers

7228 search results - page 383 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ICCSA
2004
Springer
16 years 2 days ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 10 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
16 years 1 months ago
Are evolutionary rule learning algorithms appropriate for malware detection?
In this paper, we evaluate the performance of ten well-known evolutionary and non-evolutionary rule learning algorithms. The comparative study is performed on a real-world classiï...
M. Zubair Shafiq, S. Momina Tabish, Muddassar Faro...
ATAL
2007
Springer
16 years 27 days ago
Multi-task overlapping coalition parallel formation algorithm
The issue of coalition formation has been investigated from many aspects, but until recently little attention has been paid to overlapping coalition formation. What’s more, an a...
Chao-Feng Lin, Shan-Li Hu