Sciweavers

377 search results - page 17 / 76
» A Value Theory of Meta-Learning Algorithms
Sort
View
NIPS
1998
15 years 1 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
TRIER
2002
14 years 11 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
15 years 5 months ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham
102
Voted
WWW
2011
ACM
14 years 6 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
PODS
2010
ACM
197views Database» more  PODS 2010»
14 years 12 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link