674 search results - page 64 / 135 » The computational complexity of the parallel knock-out probl... |
130
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
108
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
ARTS
1997
Springer
15 years 5 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
102
click to vote
ISORC
1998
IEEE
15 years 5 months ago
1998
IEEE
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
103
click to vote
AAAI
1990
15 years 2 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...