Sciweavers

2214 search results - page 189 / 443
» complexity 2004
Sort
View
104
Voted
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 8 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
116
Voted
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
15 years 8 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
136
Voted
GECCO
2004
Springer
182views Optimization» more  GECCO 2004»
15 years 8 months ago
On the Evolution of Analog Electronic Circuits Using Building Blocks on a CMOS FPTA
This article summarizes two experiments utilizing building blocks to find analog electronic circuits on a CMOS Field Programmable Transistor Array (FPTA). The FPTA features 256 pr...
Jörg Langeheine, Martin Trefzer, Daniel Br&uu...
120
Voted
GG
2004
Springer
15 years 8 months ago
Rule Execution in Graph-Based Incremental Interactive Integration Tools
Abstract. Development processes in engineering disciplines are inherently complex. Throughout the development process, different kinds of inter-dependent design documents are creat...
Simon M. Becker, Sebastian Lohmann, Bernhard Westf...
112
Voted
GRID
2004
Springer
15 years 8 months ago
High-Level Grid Application Environment to Use Legacy Codes as OGSA Grid Services
One of the biggest obstacles in the wide-spread industrial take-up of Grid technology is the existence of a large amount of legacy code that is not accessible as Grid services. Th...
Péter Kacsuk, Ariel Goyeneche, Thierry Dela...