4131 search results - page 306 / 827 » The Generalized Max-Controlled Set Problem |
135
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
136
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
123
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
138
click to vote
IPCO
2007
15 years 6 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
175
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...