278 search results - page 56 / 56 » Can a Graph Have Distinct Regular Partitions |
PPOPP
2005
ACM
13 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...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...