92 search results - page 6 / 19 » Evolving heuristically difficult instances of combinatorial ... |
CEC
2010
IEEE
14 years 9 months ago
2010
IEEE
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
SARA
2000
Springer
15 years 1 months ago
2000
Springer
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, wi...
ACML
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
AIR
2004
14 years 9 months ago
2004
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...