1205 search results - page 179 / 241 » On P Systems with Bounded Parallelism |
135
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
127
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
145
Voted
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
124
Voted
EUROPAR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract This paper examines the behavior of current and next generation microprocessors' fetch engines while running Decision Support Systems (DSS) workloads. We analyze the ...
150
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...