1139 search results - page 150 / 228 » Bounded Ideation Theory |
125
Voted
APAL
2005
15 years 4 months ago
2005
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
134
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
158
click to vote
ECRTS
2007
IEEE
15 years 10 months ago
2007
IEEE
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
132
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
121
Voted
EUROCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...