Sciweavers

1580 search results - page 235 / 316
» Non-Interference Through Determinism
Sort
View
COCOA
2007
Springer
14 years 4 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
IPPS
2006
IEEE
14 years 4 months ago
Techniques and tools for dynamic optimization
Traditional code optimizers have produced significant performance improvements over the past forty years. While promising avenues of research still exist, traditional static and p...
Jason Hiser, Naveen Kumar, Min Zhao, Shukang Zhou,...
IMC
2006
ACM
14 years 4 months ago
The need for cross-layer information in access point selection algorithms
The low price of commodity wireless LAN cards and access points (APs) has resulted in the rich proliferation of high density WLANs in enterprise, academic environments, and public ...
Karthikeyan Sundaresan, Konstantina Papagiannaki
MOBICOM
2006
ACM
14 years 4 months ago
A coordinate-based approach for exploiting temporal-spatial diversity in wireless mesh networks
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
Hyuk Lim, Chaegwon Lim, Jennifer C. Hou
PLDI
2006
ACM
14 years 4 months ago
Automatic instruction scheduler retargeting by reverse-engineering
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
Matthew J. Bridges, Neil Vachharajani, Guilherme O...