Sciweavers

652 search results - page 30 / 131
» Linear Explicit Substitutions
Sort
View
LICS
1995
IEEE
13 years 11 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
LFCS
2007
Springer
14 years 1 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
ISCAS
2005
IEEE
161views Hardware» more  ISCAS 2005»
14 years 1 months ago
LMI-based neurocontroller for guaranteed cost control of uncertain time-delay systems
— This paper considers the application of the neural networks for the guaranteed cost control problem of discrete– time uncertain systems that have in both state and input dela...
Hiroaki Mukaidani, S. Sakaguchi, Toshio Tsuji
IPPS
2003
IEEE
14 years 25 days ago
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
Sethavidh Gertphol, Viktor K. Prasanna
ICISC
2001
132views Cryptology» more  ICISC 2001»
13 years 9 months ago
Slide Attacks with a Known-Plaintext Cryptanalysis
Although many strong cryptanalytic tools exploit weaknesses in the data-randomizinig part of a block cipher, relatively few general tools for cryptanalyzing on the other part, the ...
Soichi Furuya