1816 search results - page 236 / 364 » A New Approach for Solving the Maximum Clique Problem |
188
click to vote
ICANN
2005
Springer
16 years 1 days ago
2005
Springer
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
208
click to vote
TON
2002
15 years 6 months ago
2002
The existing telecommunications infrastructure in most of the world is adequate to deliver voice and text applications, but demand for broadband services such as streaming video an...
187
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
211
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. ...
163
click to vote
GECCO
2007
Springer
16 years 21 days ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...