Sciweavers

1101 search results - page 100 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
14 years 11 months ago
Objective reduction using a feature selection technique
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
Antonio López Jaimes, Carlos A. Coello Coel...
PDP
2003
IEEE
15 years 3 months ago
A Parallel Evolutionary Algorithm for Circuit Partitioning
As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimi...
Raul Baños, Consolación Gil, Maria D...
FOCS
1993
IEEE
15 years 1 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
15 years 4 months ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
AAAI
2010
14 years 11 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...