Sciweavers

78 search results - page 10 / 16
» State-space analysis of Boolean networks
Sort
View
TACAS
2007
Springer
92views Algorithms» more  TACAS 2007»
15 years 9 months ago
Model Checking Liveness Properties of Genetic Regulatory Networks
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...
Grégory Batt, Calin Belta, Ron Weiss
144
Voted
TNN
2011
129views more  TNN 2011»
14 years 10 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
AAMAS
2007
Springer
15 years 9 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
EMSOFT
2006
Springer
15 years 7 months ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...
159
Voted
SIGCOMM
1991
ACM
15 years 6 months ago
A Control-Theoretic Approach to Flow Control
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the o...
Srinivasan Keshav