Eric B. Baum

Orcid: 0000-0002-8319-0561

According to our database1, Eric B. Baum authored at least 30 papers between 1987 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
TruthSift: A Platform for Collective Rationality.
Neural Comput., March, 2023

2006
Panel Discussion: What are the bottlenecks, and how soon to AGI?
Proceedings of the Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms, 2006

A Working Hypothesis for General Intelligence.
Proceedings of the Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms, 2006

2004
What is thought?
MIT Press, ISBN: 978-0-262-02548-5, 2004

2002
Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants".
Theor. Comput. Sci., 2002

2001
Evolution of Cooperative Problem Solving in an Artificial Economy.
Neural Comput., 2001

Where Genetic Algorithms Excel.
Evol. Comput., 2001

2000
An Artificial Economy of Post Production Systems.
Proceedings of the Advances in Learning Classifier Systems, Third International Workshop, 2000

1999
Propagating Distributions Up Directed Acyclic Graphs.
Neural Comput., 1999

Toward a Model of Intelligence as an Economy of Agents.
Mach. Learn., 1999

1998
A Bayesian approach to relevance in game playing.
J. Int. Comput. Games Assoc., 1998

1996
Toward a Model of Mind as a Laissez-Faire Economy of Idiots.
Proceedings of the Machine Learning, 1996

Running dynamic programming algorithms on a DNA computer.
Proceedings of the DNA Based Computers, 1996

DNA sequences useful for computation.
Proceedings of the DNA Based Computers, 1996

1995
A DNA associative memory potentially larger than the brain.
Proceedings of the DNA Based Computers, 1995

On Genetic Algorithms.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1992
On Optimal Game Tree Propagation for Imperfect Players.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Neural net algorithms that learn in polynomial time from examples and queries.
IEEE Trans. Neural Networks, 1991

The Transition to Perfect Generalization in Perceptrons.
Neural Comput., 1991

1990
A Polynomial Time Algorithm That Learns Two Hidden Unit Nets.
Neural Comput., 1990

The Perceptron Algorithm is Fast for Nonmalicious Distributions.
Neural Comput., 1990

On learning a union of half spaces.
J. Complex., 1990

Constructing Hidden Units Using Examples and Queries.
Proceedings of the Advances in Neural Information Processing Systems 3, 1990

When Are k-Nearest Neighbor and Back Propagation Accurate for Feasible Sized Sets of Examples?
Proceedings of the Neural Networks, 1990

Polynomial Time Algorithms for Learning Neural Nets.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
What Size Net Gives Valid Generalization?
Neural Comput., 1989

A Proposal for More Powerful Learning Algorithms.
Neural Comput., 1989

The Perceptron Algorithm Is Fast for Non-Malicious Distributions.
Proceedings of the Advances in Neural Information Processing Systems 2, 1989

1988
On the capabilities of multilayer perceptrons.
J. Complex., 1988

1987
Supervised Learning of Probability Distributions by Neural Networks.
Proceedings of the Neural Information Processing Systems, Denver, Colorado, USA, 1987, 1987


  Loading...