202 search results - page 20 / 41 » Complexity of local search for the p-median problem |
AIPS
2006
13 years 8 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
GECCO
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
PATAT
1995
Springer
13 years 11 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
ANOR
2010
13 years 7 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
BMCBI
2007
13 years 7 months ago
2007
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...