64 search results - page 11 / 13 » On the Capacity of Capacitated Automata |
122
Voted
NETWORKS
2006
15 years 24 days ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
100
Voted
CHARME
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
95
Voted
APN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
112
Voted
ICCS
2009
Springer
14 years 10 months ago
2009
Springer
We present a continuous time/discrete space model of biofilm growth, starting from the semi-discrete master equation. The probabilities of biomass movement into neighboring sites d...
99
Voted
VLSID
2006
IEEE
16 years 1 months ago
2006
IEEE
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...