2084 search results - page 134 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
135
click to vote
ASPDAC
2010
ACM
15 years 3 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
121
click to vote
DLOG
2007
15 years 7 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
162
Voted
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
127
click to vote
NETWORKING
2010
15 years 6 months ago
2010
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
130
Voted
COCO
1995
Springer
15 years 8 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...