Sciweavers

4498 search results - page 77 / 900
» How to Invent Functions
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
ICPR
2008
IEEE
14 years 4 months ago
Pattern vectors from the Ihara zeta function
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
Peng Ren, Richard C. Wilson, Edwin R. Hancock
CL
2000
Springer
14 years 2 months ago
Proving Failure in Functional Logic Programs
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
Francisco Javier López-Fraguas, Jaime S&aac...
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 2 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
13 years 11 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige