13603 search results - page 28 / 2721 » On the Complexity of Computing Treelength |
JFP
2000
13 years 8 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
JUCS
2010
13 years 7 months ago
2010
: For many complex and dynamic ubiquitous services, context-aware cooperation can be a solution. However, the way is not yet clear to make individual objects cooperate with each ot...
AAAI
2012
11 years 11 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
TCOM
2010
13 years 7 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...