- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A study of complexity transitions on the asymmetric traveling salesman problem
Artificial Intelligence 81 (1-2):223-239 (1996)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
The traveling salesman problem.E. L. Arnoff & S. S. Sengupta - 1961 - In Russell Lincoln Ackoff (ed.), Progress in operations research. New York,: Wiley. pp. 1--150.
Phase transitions and the search problem.Tad Hogg, Bernardo A. Huberman & Colin P. Williams - 1996 - Artificial Intelligence 81 (1-2):1-15.
Complexity and the study of artificial and human intelligence.Zenon W. Pylyshyn - 1979 - In Martin Ringle (ed.), Philosophical Perspectives in Artificial Intelligence. Humanities Press.
Darwinian dynamics: Evolutionary transitions in fitness and individuality by Richard E. Michod.Jeffrey Ihara - 1999 - Complexity 5 (1):42-43.
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
Phase transitions in artificial intelligence systems.Bernardo A. Huberman & Tad Hogg - 1987 - Artificial Intelligence 33 (2):155-171.
A note on the complexity of the causal ordering problem.Bernardo Gonçalves & Fabio Porto - 2016 - Artificial Intelligence 238 (C):154-165.
Gelfond–Zhang aggregates as propositional formulas.Pedro Cabalar, Jorge Fandinno, Torsten Schaub & Sebastian Schellhorn - 2019 - Artificial Intelligence 274 (C):26-43.
On the complexity of the partner units decision problem.Erich Christian Teppan - 2017 - Artificial Intelligence 248:112-122.
A novel memetic algorithm for solving the generalized traveling salesman problem.Ovidiu Cosma, Petrică C. Pop & Laura Cosma - forthcoming - Logic Journal of the IGPL.
Analytics
Added to PP
2020-12-22
Downloads
6 (#1,480,465)
6 months
5 (#838,466)
2020-12-22
Downloads
6 (#1,480,465)
6 months
5 (#838,466)
Historical graph of downloads
Citations of this work
Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
A complete anytime algorithm for number partitioning.Richard E. Korf - 1998 - Artificial Intelligence 106 (2):181-203.
References found in this work
Phase transitions in artificial intelligence systems.Bernardo A. Huberman & Tad Hogg - 1987 - Artificial Intelligence 33 (2):155-171.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
Searching for an optimal path in a tree with random costs.Richard M. Karp & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):99-116.
Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-xdvnm uwo