Sciweavers

3838 search results - page 571 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
120
Voted
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 9 months ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
119
Voted
GECCO
2004
Springer
15 years 9 months ago
Non-stationary Subtasks Can Improve Diversity in Stationary Tasks
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
Christopher Willis-Ford, Terence Soule
125
Voted
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
15 years 9 months ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
112
Voted
CP
2003
Springer
15 years 8 months ago
Box Constraint Collections for Adhoc Constraints
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
Chi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey
120
Voted
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
15 years 8 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...