7988 search results - page 1552 / 1598 » A Useful Undecidable Theory |
218
Voted
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
119
Voted
CTCS
1989
Springer
15 years 7 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
140
click to vote
ACMICEC
2007
ACM
15 years 7 months 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...
133
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
161
Voted
CCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...