8196 search results - page 183 / 1640 » Computational Modeling and Complexity Science |
148
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
162
click to vote
ERSHOV
2003
Springer
15 years 11 months ago
2003
Springer
The article presents an approach to model based testing of complex systems based on a generalization of finite state machines (FSM) and input output state machines (IOSM). The app...
179
click to vote
BCS
2008
15 years 8 months ago
2008
Despite over a century's study, the trigger mechanisms of cardiac arrhythmias are poorly understood. Even modern experimental methods do not provide sufficient temporal and s...
141
click to vote
MFCS
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
149
click to vote
MFCS
2007
Springer
16 years 18 days ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...