Sciweavers

937 search results - page 107 / 188
» On the Complexity of Partial Order Properties
Sort
View
AMEC
2004
Springer
15 years 11 months ago
Designing Auctions for Deliberative Agents
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
Kate Larson, Tuomas Sandholm
BIRTHDAY
2003
Springer
15 years 11 months ago
Extreme Model Checking
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 9 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
ICFEM
2009
Springer
16 years 22 days ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
WEBDB
2005
Springer
100views Database» more  WEBDB 2005»
15 years 11 months ago
Malleable Schemas: A Preliminary Report
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...
Xin Dong, Alon Y. Halevy