Sciweavers

3937 search results - page 458 / 788
» Questioning Ubiquitous Computing
Sort
View
AMAST
2008
Springer
15 years 8 months ago
A Declarative Debugger for Maude
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
CIE
2008
Springer
15 years 8 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
15 years 8 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena
CONEXT
2008
ACM
15 years 8 months ago
Incentive-compatible caching and peering in data-oriented networks
Several new, data-oriented internetworking architectures have been proposed recently. However, the practical deployability of such designs is an open question. In this paper, we c...
Jarno Rajahalme, Mikko Särelä, Pekka Nik...
DSN
2008
IEEE
15 years 8 months ago
Using an assurance case to support independent assessment of the transition to a new GPS ground control system
We describe a specific application of assurance cases to the problem of ensuring that a transition from a legacy system to its replacement will not compromise mission assurance ob...
Elisabeth A. Nguyen, William S. Greenwell, Myron H...