You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Literatura 179<br />
⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯<br />
[Bëc91a] Bëck T., Hoffmeister F., Schwefel H.P., "A Survey of Evolution<br />
Strategies", In: Proceedings of the Fourth International Conference on<br />
Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 2-9 (1991).<br />
ftp://lumpi.informatik.uni-dortmund.de/pub/GA/papers/icga91.ps.gz<br />
[Bëc91b] Bëck T., Hoffmeister F., "Extended selection mechanisms in genetic<br />
algorithms", In: Proceedings of the Fourth International Conference on<br />
Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 92-99<br />
(1991).<br />
ftp://lumpi.informatik.uni-dortmund.de/pub/ES/papers/icga91-2.ps.gz<br />
[Bëc92a] Bëck T., "Self-adaptation in Genetic Algorithms", In: Proceedings of the<br />
First European Conference on Artificial Life, MIT Press (1992).<br />
ftp://lumpi.informatik.uni-dortmund.de/pub/GA/papers/ecal92.ps.gz<br />
[Bëc92b] Bëck T., "A User Guide to GENEsYs 1.0", Technical Report, University of<br />
Dortmund, Department of Computer Science, Germany (1992).<br />
[Bëc93] Bëck T., "Optimal Mutation Rates in Genetic Search", In: Proceedings of<br />
the Fifth International Conference on Genetic Algorithms, Morgan<br />
Kaufmann, San Mateo, Calif., pp. 2-8 (1993).<br />
ftp://lumpi.informatik.uni-dortmund.de/pub/GA/papers/icga93.ps.gz<br />
[Bla87] Balakrishnan A., "LP Extreme Points and Cuts for the Fixed-Charge<br />
Network Design Problem", Mathematical Programming, Vol. 39, pp. 263-<br />
284, (1987).<br />
[Bla89] Balakrishnan A., Magnati T.L., Wong R.T., "A Dual-Ascent Procedure for<br />
Large-Scale Uncapacitated Network Design", Operations Research, Vol.<br />
37, pp. 716-740 (1989).<br />
[Bld95] Belding T.C., "The Distributed Genetic Algorithm Revisited", In:<br />
Proceedings of the Sixth International Conference on Genetic Algorithms -<br />
ICGA '95, Morgan Kaufmann, San Mateo, Calif., pp. 114-121 (1995).<br />
ftp://ftp.Germany.EU.net/pub/research/softcomp/EC/GA/papers/dga95.ps.gz<br />
[Blm58] Bellman R.E., "On a Routing Problem", Quarterly Applied Mathematics,<br />
Vol. 16, pp. 87-90 (1958).<br />
[Blu97] Baluja S., Davies S., "Using Optimal Dependency Trees for Combinatorial<br />
Optimization: Learning the Structure of the Search Space", Report CMU-<br />
CS-97-107, Carnegie Mellon University (1997).<br />
[Bok87] Booker L., "Improving Search in Genetic Algorithms", In: Genetic<br />
Algorithms and Simulated Annealing, Pitman Publishing, London, pp. 61-73<br />
(1987).<br />
[Bon85] Bonanno R., Maio D., Tiberio P., "An approximation algorithm for<br />
secondary index selection in relational database physical design", The<br />
Computer Journal, Vol. 28, pp. 398-405 (1985).<br />
[Brme95] Bramel J., Simchi-Levi D., "A Location Based Heuristic for General<br />
Routing Problems", Operations Research, Vol. 43, No. 4, pp. 649-660<br />
(1995).<br />
[Brml91] Bramlette M.F., "Initialisation, mutation and selection methods in genetic<br />
algorithms for function optimization", In: Proceedings of the Fourth<br />
International Conference on Genetic Algorithms, Morgan Kaufmann, San<br />
Mateo, Calif., pp. 100-107 (1991).<br />
[Brs88] Brassard G., Bratley P., "Algorithms: Theory and Practice", Prentice-Hall<br />
Int., Englewoods Cliffs NJ (1988).<br />
[Bum89] Bum-Il L., "On the Uncapacitated Facility Location Problem", PhD thesis,<br />
Dept. of Business Management, Dan Kook University, South Corea (1989).<br />
[Bur94] Burns G.D., Daoud R.B., Vaigl J.R., "LAM: An Open Cluster Environment<br />
for MPI", Supercomputing Symposium '94, Toronto, Canada, June 1994.<br />
http://www.mpi.nd.edu/lam/lam-mpi.paper.ps<br />
[But94] Butler R., Lusk E., "Monitors, Messages, and Clusters: The p4 Parallel<br />
Programming System", Parallel Computing, Vol. 20 (1994).
Change language