Sciweavers

287 search results - page 17 / 58
» A Tree Search Algorithm for Solving the Container Loading Pr...
Sort
View
EAAI
2008
101views more  EAAI 2008»
13 years 7 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 1 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
EOR
2010
140views more  EOR 2010»
13 years 4 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
14 years 1 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
GECCO
2005
Springer
14 years 1 months ago
Evaluating GP schema in context
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
Hammad Majeed, Conor Ryan, R. Muhammad Atif Azad