Sciweavers

4586 search results - page 856 / 918
» Computing stable models in parallel
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICDCS
2003
IEEE
15 years 5 months ago
Collision Avoidance in Single-Channel Ad Hoc Networks Using Directional Antennas
Three collision-avoidance protocols are analyzed that use omni-directional packet reception together with omnidirectional transmissions, directional transmissions, or a combinatio...
Yu Wang, J. J. Garcia-Luna-Aceves
PODC
2003
ACM
15 years 5 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
PPOPP
2003
ACM
15 years 5 months ago
Improving server software support for simultaneous multithreaded processors
Simultaneous multithreading (SMT) represents a fundamental shift in processor capability. SMT's ability to execute multiple threads simultaneously within a single CPU offers ...
Luke McDowell, Susan J. Eggers, Steven D. Gribble
SPAA
2003
ACM
15 years 5 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...