8196 search results - page 183 / 1640 » Computational Modeling and Complexity Science |
155
click to vote
ICALP
2005
Springer
16 years 14 days 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 ...
177
Voted
ERSHOV
2003
Springer
16 years 5 days 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...
193
Voted
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...
150
Voted
MFCS
2007
Springer
16 years 1 months 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...
162
Voted
MFCS
2007
Springer
16 years 1 months 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...