Author of the publication

A New Deterministic Annealing Algorithm for Maximum Clique.

, , and . IJCNN (6), page 505-508. IEEE Computer Society, (2000)0-7695-0619-4.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Energy function-based approaches to graph coloring., , and . IEEE Trans. Neural Networks, 13 (1): 81-91 (2002)On the equivalence of two Hopfield-type networks., and . ICNN, page 1063-1068. IEEE, (1993)Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique., and . J. Heuristics, 7 (6): 565-585 (2001)Approximately solving Maximum Clique using neural network and related heuristics., , and . Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 169-204. DIMACS/AMS, (1993)Good Rings in Grids with Bad Nodes., and . PDPTA, page 725-733. CSREA Press, (1996)Connectionist Symbol Processing: Dead or Alive?, , , and . Neural Computing Surveys, (1999)Applying a Hopfield-style network to degraded text recognition.. IJCNN, page 27-32. IEEE, (1990)Optimization by reduction to maximum clique.. ICNN, page 1526-1531. IEEE, (1993)A New Deterministic Annealing Algorithm for Maximum Clique., , and . IJCNN (6), page 505-508. IEEE Computer Society, (2000)0-7695-0619-4.Decoding independent sets from an analog Hopfield network., , and . Neural Parallel & Scientific Comp., 4 (3): 263-276 (1996)