31 search results - page 6 / 7 » Progressive cut |
106
click to vote
MINENET
2006
ACM
15 years 3 months ago
2006
ACM
Progress in networking research depends crucially on applying novel analysis tools to real-world traces of network activity. This often conflicts with privacy and security requir...
111
click to vote
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
101
click to vote
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...