Sciweavers

240 search results - page 46 / 48
» Context-Aware Trust Domains
Sort
View
ATAL
2005
Springer
13 years 11 months ago
Kaa: policy-based explorations of a richer model for adjustable autonomy
Though adjustable autonomy is hardly a new topic in agent systems, there has been a general lack of consensus on terminology and basic concepts. In this paper, we describe the mul...
Jeffrey M. Bradshaw, Hyuckchul Jung, Shriniwas Kul...
IPTPS
2004
Springer
13 years 11 months ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...
PLDI
2010
ACM
13 years 10 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
ECMDAFA
2006
Springer
166views Hardware» more  ECMDAFA 2006»
13 years 9 months ago
Dynamic Logic Semantics for UML Consistency
Abstract. The Unified Modelling Language (UML) is intended to describe systems, but it is not clear what systems satisfy a given collection of UML diagrams. Stephen Mellor has desc...
Greg O'Keefe
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 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...