Sciweavers

397 search results - page 41 / 80
» An empirical study of optimizations in YOGI
Sort
View
IWINAC
2007
Springer
14 years 1 months ago
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern&aa...
MICAI
2007
Springer
14 years 1 months ago
Building Fine Bayesian Networks Aided by PSO-Based Feature Selection
A successful interpretation of data goes through discovering crucial relationships between variables. Such a task can be accomplished by a Bayesian network. The dark side is that, ...
María del Carmen Chávez, Gladys Casa...
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ISNN
2005
Springer
14 years 1 months ago
Feature Selection and Intrusion Detection Using Hybrid Flexible Neural Tree
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
Yuehui Chen, Ajith Abraham, Ju Yang
ACML
2009
Springer
13 years 11 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo