- 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
Investigating production system representations for non-combinatorial match
Artificial Intelligence 68 (1):155-199 (1994)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Investigating the properties of neural network representations in reinforcement learning.Han Wang, Erfan Miahi, Martha White, Marlos C. Machado, Zaheer Abbas, Raksha Kumaraswamy, Vincent Liu & Adam White - 2024 - Artificial Intelligence 330 (C):104100.
Integration of memory systems supporting non-symbolic representations in an architecture for lifelong development of artificial agents.François Suro, Fabien Michel & Tiberiu Stratulat - 2024 - Artificial Intelligence 337 (C):104228.
Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
Tractable combinatorial auctions and b-matching.Moshe Tennenholtz - 2002 - Artificial Intelligence 140 (1-2):231-243.
Algorithm for optimal winner determination in combinatorial auctions.Tuomas Sandholm - 2002 - Artificial Intelligence 135 (1-2):1-54.
Enactive artificial intelligence: Investigating the systemic organization of life and mind.Tom Froese & Tom Ziemke - 2009 - Artificial Intelligence 173 (3-4):466-500.
A language and a program for stating and solving combinatorial problems.Jena-Lonis Lauriere - 1978 - Artificial Intelligence 10 (1):29-127.
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions.Baharak Rastegari, Anne Condon & Kevin Leyton-Brown - 2011 - Artificial Intelligence 175 (2):441-456.
BOB: Improved winner determination in combinatorial auctions and generalizations.Tuomas Sandholm & Subhash Suri - 2003 - Artificial Intelligence 145 (1-2):33-58.
Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.
Analytics
Added to PP
2020-12-22
Downloads
12 (#1,360,486)
6 months
4 (#1,238,277)
2020-12-22
Downloads
12 (#1,360,486)
6 months
4 (#1,238,277)
Historical graph of downloads
Author's Profile
Citations of this work
Bounding the cost of learned rules.Jihie Kim & Paul S. Rosenbloom - 2000 - Artificial Intelligence 120 (1):43-80.
References found in this work
SOAR: An architecture for general intelligence.John E. Laird, Allen Newell & Paul S. Rosenbloom - 1987 - Artificial Intelligence 33 (1):1-64.
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
R1: A rule-based configurer of computer systems.John McDermott - 1982 - Artificial Intelligence 19 (1):39-88.
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-f8568656d-2jqln uwo