Sciweavers

4903 search results - page 321 / 981
» The Set Covering Machine
Sort
View
SEAL
1998
Springer
15 years 11 months ago
Using Genetic Algorithms to Simulate the Evolution of an Oligopoly Game
Abstract. This paper extends the N-person IPD game into a more interesting game in economics, namely, the oligopoly game. Due to its market share dynamics, the oligopoly game is mo...
Shu-Heng Chen, Chih-Chi Ni
COLT
1993
Springer
15 years 11 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
COLT
1994
Springer
15 years 11 months ago
Efficient Reinforcement Learning
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
Claude-Nicolas Fiechter
182
Voted
COLT
1992
Springer
15 years 11 months ago
Dominating Distributions and Learnability
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...
Gyora M. Benedek, Alon Itai
ISCA
1989
IEEE
1033views Hardware» more  ISCA 1989»
15 years 11 months ago
Can Dataflow Subsume von Neumann Computing?
: We explore the question: “What can a von Neumann processor borrow from dataflow to make it more suitable for a multiprocessor?’’ Starting with a simple, “RISC-like” ins...
Rishiyur S. Nikhil