39 search results - page 2 / 8 » SPEED: Symbolic Complexity Bound Analysis |
ICCAD
2010
IEEE
13 years 3 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
JOC
2011
13 years 7 days ago
2011
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
FMCAD
2004
Springer
13 years 10 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
TCOM
2010
13 years 3 months ago
2010
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...