1200 search results - page 130 / 240 » Marked Ancestor Problems |
131
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We study the problem of determining, given a run of a concurrent program, whether there is any alternate execution of it that violates atomicity, where atomicity is defin...
246
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
Network protocol design is usually an informal process where debugging is based on successive iterations of a prototype implementation. The feedback provided by a prototype can be...
138
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
126
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
146
click to vote
ICCAD
2008
IEEE
16 years 2 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...