Sciweavers

106
Voted
ICCAD
1998
IEEE
86views Hardware» more  ICCAD 1998»
15 years 7 months ago
Polynomial methods for component matching and verification
James Smith, Giovanni De Micheli
139
Voted
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 7 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
100
Voted
GECCO
2000
Springer
106views Optimization» more  GECCO 2000»
15 years 7 months ago
Multi-objective pattern and feature selection by a genetic algorithm
Hisao Ishibuchi, Tomoharu Nakashima
144
Voted
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
15 years 7 months ago
Linguistic Rule Extraction by Genetics-Based Machine Learning
This paper shows how linguistic classification knowledge can be extracted from numerical data for pattern classification problems with many continuous attributes by genetic algori...
Hisao Ishibuchi, Tomoharu Nakashima
154
Voted
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 years 7 months ago
Controlling Effective Introns for Multi-Agent Learning by Genetic Programming
This paper presents the emergence of the cooperative behavior for multiple agents by means of Genetic Programming (GP). For the purpose of evolving the effective cooperative behav...
Hitoshi Iba, Makoto Terao