Sciweavers

5378 search results - page 1002 / 1076
» Base Logics in Argumentation
Sort
View
RTAS
2010
IEEE
13 years 7 months ago
Physicalnet: A Generic Framework for Managing and Programming Across Pervasive Computing Networks
This paper describes the design and implementation of a pervasive computing framework, named Physicalnet. Essentially, Physicalnet is a generic paradigm for managing and programmi...
Pascal Vicaire, Zhiheng Xie, Enamul Hoque, John A....
UIC
2010
Springer
13 years 7 months ago
A Lattice-Theoretic Approach to Runtime Property Detection for Pervasive Context
Abstract. Runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. Existing property detection schemes implicitly assume that cont...
Tingting Hua, Yu Huang 0002, Jiannong Cao, XianPin...
UTP
2010
13 years 7 months ago
Unifying Theories in Isabelle/HOL
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
Abderrahmane Feliachi, Marie-Claude Gaudel, Burkha...
VL
2010
IEEE
216views Visual Languages» more  VL 2010»
13 years 7 months ago
Explanatory Debugging: Supporting End-User Debugging of Machine-Learned Programs
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a “prog...
Todd Kulesza, Simone Stumpf, Margaret M. Burnett, ...
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 7 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
« Prev « First page 1002 / 1076 Last » Next »