Sciweavers

1070 search results - page 56 / 214
» Type Classes with Functional Dependencies
Sort
View
ICML
1995
IEEE
14 years 8 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
GI
1997
Springer
13 years 12 months ago
Functional Object-Oriented Programming with Object-Gofer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
Wolfram Schulte, Klaus Achatz
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
TIP
1998
162views more  TIP 1998»
13 years 7 months ago
Variational image segmentation using boundary functions
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
Gary A. Hewer, Charles S. Kenney, B. S. Manjunath
ICML
2003
IEEE
14 years 8 months ago
Using Linear-threshold Algorithms to Combine Multi-class Sub-experts
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
Chris Mesterharm