Sciweavers

17329 search results - page 91 / 3466
» Improved non-approximability results
Sort
View
ASPLOS
2011
ACM
13 years 12 days ago
Improving the performance of trace-based systems by false loop filtering
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mau...
CN
1999
77views more  CN 1999»
13 years 8 months ago
Web Content Adaptation to Improve Server Overload Behavior
This paper presents a study of web content adaptation to improve server overload performance, as well as an implementation of a web content adaptation software prototype. When the...
Tarek F. Abdelzaher, Nina T. Bhatti
VLDB
2002
ACM
120views Database» more  VLDB 2002»
13 years 8 months ago
Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services
The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has prov...
Samuel Kounev, Alejandro P. Buchmann
WINET
2002
124views more  WINET 2002»
13 years 8 months ago
Improving Energy Efficiency of Centrally Controlled Wireless Data Networks
Wireless network access protocols can assist nodes to conserve energy by identifying when they can enter low energy states. The goal is to put all nodes not involved in a transmiss...
John A. Stine, Gustavo de Veciana
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...