10054 search results - page 250 / 2011 » On the Complexity of Function Learning |
131
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
119
click to vote
BIOSYSTEMS
2007
15 years 3 months ago
2007
Alternative pathways through a gene regulation network connect a regulatory molecule to its (indirect) regulatory target via different intermediate regulators. We here show for tw...
117
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Transfer learning problems are typically framed as leveraging knowledge learned on a source task to improve learning on a related, but different, target task. Current transfer met...
162
click to vote
ROBOCUP
2004
Springer
15 years 8 months ago
2004
Springer
The existing reinforcement learning approaches have been suffering from the policy alternation of others in multiagent dynamic environments such as RoboCup competitions since othe...