4488 search results - page 25 / 898 » Focusing Search by Using Problem Solving Experience |
124
Voted
EUROCAST
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
118
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
127
click to vote
AAAI
2008
15 years 4 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
124
click to vote
EUROCAST
2007
Springer
15 years 6 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
134
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...