7106 search results - page 943 / 1422 » Restricted Complexity, General Complexity |
207
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by the need for unification of the domain of data mining and the demand for formalized representation of outcomes of data mining investigations, we address the task of c...
176
click to vote
EUROGP
2009
Springer
16 years 1 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
185
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
196
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
159
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Evolution of multi-agent teams has been shown to be an effective method of solving complex problems involving the exploration of an unknown problem space. These autonomous and het...