448 search results - page 48 / 90 » The Complexity of Codiagnosability for Discrete Event and Ti... |
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
KES
1998
Springer
13 years 12 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
AUTONOMICS
2008
ACM
13 years 9 months ago
2008
ACM
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...