3179 search results - page 604 / 636 » Applications of PCF Theory |
COLT
1993
Springer
14 years 24 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
PODS
1994
ACM
14 years 23 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
CTRS
1990
14 years 23 days ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
ACMICEC
2007
ACM
14 years 21 days ago
2007
ACM
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
ATAL
2007
Springer
14 years 21 days ago
2007
Springer
Norm-governed virtual organizations define, govern and facilitate coordinated resource sharing and problem solving in societies of agents. With an explicit account of norms, openn...