4041 search results - page 567 / 809 » time 2009 |
212
click to vote
GECCO
2009
Springer
16 years 1 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. ...
176
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...
241
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Modern computer games are at the same time an attractive application domain and an interesting testbed for the evolutionary computation techniques. In this paper we apply NeuroEvo...
192
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to ...
181
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale problem involving a large number of process...