1763 search results - page 175 / 353 » A Formalization of Polytime Functions |
122
click to vote
EUSFLAT
2003
15 years 5 months ago
2003
Functional laws may be known only at a finite number of points, and then the function can be completed by interpolation techniques obeying some smoothness conditions. We rather pr...
173
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
123
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
137
click to vote
ALIFE
2006
15 years 4 months ago
2006
One of the major challenges in the field of neurally driven evolved autonomous agents is deciphering the neural mechanisms underlying their behavior. Aiming at this goal, we have d...
124
click to vote
JFP
2006
15 years 4 months ago
2006
A huge discrepancy between theory and practice exists in one popular application area of functional programming--spreadsheets. Although spreadsheets are the most frequently used (...