5964 search results - page 418 / 1193 » A theory of speculative computation |
221
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
187
click to vote
CALCO
2009
Springer
16 years 2 months ago
2009
Springer
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....
166
click to vote
SAGT
2009
Springer
16 years 2 months ago
2009
Springer
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h]n , has expected profit E[P(b)]. Aggarwal et al. showed that given A, ...
217
click to vote
FOAL
2009
ACM
16 years 2 months ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
180
click to vote
LICS
2008
IEEE
16 years 2 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...