1242 search results - page 106 / 249 » A Computational Complexity Theory in Membrane Computing |
CONCUR
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
FUN
2010
Springer
15 years 2 months ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
BMCBI
2010
14 years 10 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...