287 search results - page 20 / 58 » A Tree Search Algorithm for Solving the Container Loading Pr... |
IWCLS
2007
Springer
14 years 1 months ago
2007
Springer
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
AAAI
2000
13 years 8 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...