Sciweavers

10054 search results - page 364 / 2011
» On the Complexity of Function Learning
Sort
View
ICML
2007
IEEE
16 years 5 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
ICGI
2000
Springer
15 years 7 months ago
Counting Extensional Differences in BC-Learning
Let BC be the model of behaviourally correct function learning as introduced by B
Frank Stephan, Sebastiaan Terwijn
ICFP
2007
ACM
16 years 4 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
APBC
2004
116views Bioinformatics» more  APBC 2004»
15 years 5 months ago
Structure-Function Relationship in DNA Sequence Recognition by Transcription Factors
Transcription factors play essential role in the gene regulation in higher organisms, binding to multiple target sequences and regulating multiple genes in a complex manner. In or...
Akinori Sarai, Samuel Selvaraj, M. Michael Gromiha...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
16 years 1 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi