Sciweavers

16404 search results - page 932 / 3281
» A set coverage problem
Sort
View
GECCO
2004
Springer
16 years 1 months ago
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
Gerulf K. M. Pedersen, David E. Goldberg
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
16 years 1 months ago
Clustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
Weiguo Sheng, Allan Tucker, Xiaohui Liu
HUMAN
2003
Springer
16 years 28 days ago
A Study on Monitoring and Protecting Computer System against Interception Threat
Perfect protection against all system threats is considered to be impossible. The problem of monitoring against the threats has been an issue in literature, but its progress has no...
Seongje Cho, Chulyean Chang, Joonmo Kim, Jongmoo C...
WAIM
2010
Springer
16 years 23 days ago
Semi-supervised Learning from Only Positive and Unlabeled Data Using Entropy
Abstract. The problem of classification from positive and unlabeled examples attracts much attention currently. However, when the number of unlabeled negative examples is very sma...
Xiaoling Wang, Zhen Xu, Chaofeng Sha, Martin Ester...
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
16 years 19 days ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley