1242 search results - page 11 / 249 » A Computational Complexity Theory in Membrane Computing |
LOGCOM
2007
13 years 6 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
DAGSTUHL
2007
13 years 8 months ago
2007
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
LICS
2009
IEEE
14 years 1 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
TARK
2007
Springer
14 years 25 days ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
AAAI
2000
13 years 8 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...