3008 search results - page 578 / 602 » Independence in connected graphs |
145
Voted
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
155
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
175
click to vote
LCTRTS
2005
Springer
15 years 10 months ago
2005
Springer
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
124
Voted
SSS
2005
Springer
15 years 10 months ago
2005
Springer
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
133
click to vote
VSTTE
2005
Springer
15 years 10 months ago
2005
Springer
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...