Sciweavers

684 search results - page 132 / 137
» A characterization of b-perfect graphs
Sort
View
WG
2005
Springer
14 years 4 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
ASPLOS
2004
ACM
14 years 4 months ago
Compiler orchestrated prefetching via speculation and predication
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...
Rodric M. Rabbah, Hariharan Sandanagobalane, Mongk...
IPSN
2004
Springer
14 years 4 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
OOPSLA
2004
Springer
14 years 4 months ago
Method-level phase behavior in java workloads
Java workloads are becoming more and more prominent on various computing devices. Understanding the behavior of a Java workload which includes the interaction between the applicat...
Andy Georges, Dries Buytaert, Lieven Eeckhout, Koe...
EUROMICRO
2003
IEEE
14 years 4 months ago
Web Service Composition Languages: Old Wine in New Bottles?
Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented w...
Wil M. P. van der Aalst, Marlon Dumas, Arthur H. M...