1090 search results - page 115 / 218 » The Equivalence between Biology and Computation |
COCO
1992
Springer
15 years 5 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
111
Voted
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. As part of ongoing work on evaluating Milner's bigraphical reactive systems, we investigate bigraphical models of context-aware systems, a facet of ubiquitous comput...
82
Voted
DLT
2007
15 years 2 months ago
2007
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In...
104
click to vote
CJ
2010
15 years 28 days ago
2010
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
91
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...