Sciweavers

13784 search results - page 2644 / 2757
» On Computing Functions with Uncertainty
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 3 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
ATAL
2007
Springer
14 years 3 months ago
The IEEE FIPA approach to integrating software agents and web services
In many settings Web services are now perceived as the first choice technology to provide neatly encapsulated functionality for Web-based computation. To date, many standards hav...
Dominic Greenwood, Margaret Lyell, Ashok U. Mallya...
ATAL
2007
Springer
14 years 3 months ago
Sharing experiences to learn user characteristics in dynamic environments with sparse data
This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agen...
David Sarne, Barbara J. Grosz
BTW
2007
Springer
136views Database» more  BTW 2007»
14 years 3 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
CAV
2007
Springer
166views Hardware» more  CAV 2007»
14 years 3 months ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...
« Prev « First page 2644 / 2757 Last » Next »