9842 search results - page 1789 / 1969 » The Complexity of the Matching-Cut Problem |
126
click to vote
MEMOCODE
2007
IEEE
15 years 10 months ago
2007
IEEE
The always increasing complexity of digital system is overcome in design flows based on Transaction Level Modeling (TLM) by designing and verifying the system at difbstraction le...
150
click to vote
MEMOCODE
2007
IEEE
15 years 10 months ago
2007
IEEE
Due to the rapidly growing speed and the decreasing size of gates in modern chips, the probability of faults caused by the production process grows. Already small variations lead ...
119
click to vote
PRDC
2007
IEEE
15 years 10 months ago
2007
IEEE
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
143
click to vote
QEST
2007
IEEE
15 years 10 months ago
2007
IEEE
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
144
click to vote
RTSS
2007
IEEE
15 years 10 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...