1840 search results - page 108 / 368 » time 2002 |
117
click to vote
CSL
2002
Springer
15 years 4 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
120
click to vote
ET
2002
15 years 4 months ago
2002
Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This...
133
click to vote
QUESTA
2002
15 years 3 months ago
2002
We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding ...
131
click to vote
TCAD
2002
15 years 3 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
175
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race co...