Sciweavers

12194 search results - page 420 / 2439
» cans 2010
Sort
View
RP
2010
Springer
126views Control Systems» more  RP 2010»
15 years 6 months ago
Lossy Counter Machines Decidability Cheat Sheet
Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...
Philippe Schnoebelen
RTAS
2010
IEEE
15 years 6 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson
RULEML
2010
Springer
15 years 6 months ago
Superiority Based Revision of Defeasible Theories
We propose a systematic investigation on how to modify a preference relation in a defeasible logic theory to change the conclusions of the theory itself. We argue that the approach...
Guido Governatori, Francesco Olivieri, Simone Scan...
SCN
2010
Springer
129views Communications» more  SCN 2010»
15 years 6 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
SIGACT
2010
74views more  SIGACT 2010»
15 years 6 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel