Sciweavers

1090 search results - page 115 / 218
» The Equivalence between Biology and Computation
Sort
View
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
15 years 10 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
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...
Stephen A. Bloch
FOSSACS
2006
Springer
15 years 10 months ago
Bigraphical Models of Context-Aware Systems
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...
Lars Birkedal, Søren Debois, Ebbe Elsborg, ...
DLT
2007
15 years 7 months ago
Coding Partitions: Regularity, Maximality and Global Ambiguity
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...
Marie-Pierre Béal, Fabio Burderi, Antonio R...
CJ
2010
114views more  CJ 2010»
15 years 6 months ago
Using the Relational Model to Capture Topological Information of Spaces
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...
Patrick Erik Bradley, Norbert Paul
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 6 months ago
Best-Effort Strategies for Losing States
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...
Marco Faella