Sciweavers

1557 search results - page 46 / 312
» Programming up to Congruence
Sort
View
ICML
2006
IEEE
15 years 5 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ECML
2006
Springer
15 years 1 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra
SIGDIAL
2010
14 years 9 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...
ICCAD
1996
IEEE
114views Hardware» more  ICCAD 1996»
15 years 3 months ago
An efficient approach to simultaneous transistor and interconnect sizing
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
Jason Cong, Lei He
TACAS
1997
Springer
72views Algorithms» more  TACAS 1997»
15 years 3 months ago
The Term Processor Generator Kimwitu
The Kimwitu system is a meta-tool that supports the construction of programs (tools) that operate on trees or terms. The system supports open multi-paradigm programming, in that i...
Peter van Eijk, Axel Belinfante, Henk Eertink, Hen...