18306 search results - page 3062 / 3662 » Algorithmics in Exponential Time |
206
click to vote
GECCO
2009
Springer
16 years 25 days 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. ...
167
click to vote
GECCO
2009
Springer
16 years 25 days 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...
233
Voted
GECCO
2009
Springer
16 years 25 days 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...
148
click to vote
ISVC
2009
Springer
16 years 25 days ago
2009
Springer
5th International Symposium on Visual Computing, Las Vegas, Nevada, USA, Nov 30 - Dec 2, 2009 The goal of lossy image compression ought to be reducing entropy while preserving the...
158
click to vote
JSSPP
2009
Springer
16 years 25 days ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...