1355 search results - page 136 / 271 » Alternating Timed Automata over Bounded Time |
ISPD
2004
ACM
14 years 2 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
ANCS
2007
ACM
14 years 1 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
EDCC
2005
Springer
14 years 2 months ago
2005
Springer
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...