1653 search results - page 201 / 331 » Computer science and game theory |
CIE
2010
Springer
15 years 2 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
92
Voted
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
80
Voted
SIGECOM
2005
ACM
15 years 4 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
103
Voted
AIM
2005
14 years 10 months ago
2005
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
90
Voted
SMC
2007
IEEE
15 years 5 months ago
2007
IEEE
—In Service Oriented Architecture (SOA), service brokers could find many service providers which offer same function with different quality of service (QoS). Under this condition...