1383 search results - page 260 / 277 » On the Complexity of the Interlace Polynomial |
161
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
166
click to vote
WISEC
2009
ACM
16 years 26 days ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
194
click to vote
CCECE
2009
IEEE
16 years 25 days ago
2009
IEEE
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
204
Voted
COCO
2009
Springer
16 years 20 days ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
170
click to vote
CONCUR
2009
Springer
16 years 20 days ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...