Sciweavers

183 search results - page 5 / 37
» Complete Minors and Independence Number
Sort
View
IPPS
2003
IEEE
14 years 24 days ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
IISWC
2006
IEEE
14 years 1 months ago
Comparing Benchmarks Using Key Microarchitecture-Independent Characteristics
— Understanding the behavior of emerging workloads is important for designing next generation microprocessors. For addressing this issue, computer architects and performance anal...
Kenneth Hoste, Lieven Eeckhout
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
SIGUCCS
2000
ACM
13 years 12 months ago
Implementing LIES (Location Independent Email Service)
This paper will provide a useful guide to those schools that have not yet implemented IMAP and are considering doing so. With both the systems and user services perspectives, any ...
Pamela Vogel, John Spadaro
PODC
2005
ACM
14 years 1 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer