Bibliography: Algorithms
The original BibTeX file from which this file was generated is available
at http://www.cs.odu.edu/~jbollen/bibliographies/bibtex/CS_alg.bib. Please note that the file
http://www.cs.odu.edu/~jbollen/bibliographies/bibtex/header.bib
containing string definitions is also required.
Last update: Tuesday 16 August 2005
Current number of entries: 11
-
I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein.
ANTS: Agents on networks, trees, and subgraphs.
Future Generation Computer Systems, 16(8):915-926, 2000.
-
B. Everitt.
Cluster analysis.
Halsted Press, New York, 1974.
-
H. Spath.
Cluster analysis algorithms.
Ellis Horwood, Chichester, UK, 1980.
-
O. Polgár, M. Fried, T. Lohner, and I. Bársony.
Comparison of algorithms used for evaluation of ellipsometric measurements
random search, genetic algorithms, simulated annealing and hill climbing
graph-searches.
Surface Science, 457(1-2):157 -- 177, 1 2000.
-
A. Colorni, M. Dorigo, and V. Maniezzo.
Distributed optimization by ant colonies.
In Proceedings of the First European Conference on Artificial
Life, pages 134 -- 142, Paris, France, 1992.
-
H. Botee and E. Bonabeau.
Evolving ant colony optimization.
Advances in Complex Systems, 1(2-3):149 -- 159, 1999.
-
M. Bianchini, M. Gori, and F. Scarselli.
Inside pagerank.
ACM Trans. Inter. Tech., 5(1):92-128, 2005.
-
T. H. Cormen, C. E. Leiserson, and R. L. Rivest.
Introduction to Algorithms.
The MIT press, Cambridge, Massachusetts, 1997.
-
R. Greiner.
Palo: a probabilistic hill-climbing algorithm.
Artificial Intelligence, 84(1-2):177 -- 208, 1996.
-
E. Bonabeau, M. Dorigo, and G. Theraulaz.
Swarm intelligence : from natural to artificial systems.
Oxford University Press, New York, 1999.
-
S. A. Dunn.
The use of genetic algorithms and stochastic hill-climbing in dynamic finite
element model identification.
Computers & Structures, 66(4):489 -- 497, February 1998.