Sciweavers

1101 search results - page 124 / 221
» Forcing in proof theory
Sort
View
95
Voted
RTAS
2010
IEEE
14 years 11 months ago
Scheduling Dependent Periodic Tasks without Synchronization Mechanisms
—This article studies the scheduling of critical embedded systems, which consist of a set of communicating periodic tasks with constrained deadlines. Currently, tasks are usually...
Julien Forget, Frédéric Boniol, Emma...
109
Voted
FSTTCS
2010
Springer
14 years 10 months ago
Lower bounds for Quantum Oblivious Transfer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
André Chailloux, Iordanis Kerenidis, Jamie ...
101
Voted
SIAMMA
2010
81views more  SIAMMA 2010»
14 years 7 months ago
Heteroclinic Travelling Waves in Convex FPU-Type Chains
We consider infinite FPU-type atomic chains with general convex potentials and study the existence of monotone fronts that are heteroclinic travelling waves connecting constant asy...
Michael Herrmann, Jens D. M. Rademacher
93
Voted
ACSD
2009
IEEE
106views Hardware» more  ACSD 2009»
15 years 3 months ago
Specification Enforcing Refinement for Convertibility Verification
Protocol conversion deals with the automatic synthesis of an additional component, often referred to as an adaptor or a converter, to bridge mismatches between interacting compone...
Partha S. Roop, Alain Girault, Roopak Sinha, Grego...
CLA
2007
15 years 2 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig