Sciweavers

2465 search results - page 229 / 493
» Automata on Linear Orderings
Sort
View
TLCA
2007
Springer
16 years 20 days ago
A Substructural Type System for Delimited Continuations
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
Oleg Kiselyov, Chung-chieh Shan
ISCAS
2006
IEEE
92views Hardware» more  ISCAS 2006»
16 years 18 days ago
Time-sliding suboptimal regulation of bilinear interconnected systems
— This paper focuses on the suboptimal regulation of multivariable discrete-time bilinear systems consisting of interconnected bilinear subsystems with respect to a linear quadra...
Manuel de la Sen, Aitor J. Garrido, J. C. Soto, Os...
ICML
2006
IEEE
16 years 16 days ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
16 years 2 days ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
SACRYPT
2005
Springer
16 years 1 days ago
Proving the Security of AES Substitution-Permutation Network
In this paper we study the substitution-permutation network (SPN) on which AES is based. We introduce AES∗ , a SPN identical to AES except that fixed S-boxes are replaced by ran...
Thomas Baignères, Serge Vaudenay