Sciweavers

1897 search results - page 153 / 380
» Conditional Linear Planning
Sort
View
FSE
1999
Springer
92views Cryptology» more  FSE 1999»
15 years 8 months ago
A New Characterization of Almost Bent Functions
We study the functions from Fm 2 into Fm 2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost ben...
Anne Canteaut, Pascale Charpin, Hans Dobbertin
CDC
2009
IEEE
15 years 8 months ago
Transformability from discrete-time periodic non-homogeneous systems to time-invariant ones
Abstract-- This paper considers when a discrete-time periodic non-homogeneous system can be transformed to a time-invariant one by using regular linear mappings of state variables,...
Yoshikazu Hayakawa, Tomohiko Jimbo
145
Voted
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 7 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
CDC
2008
IEEE
291views Control Systems» more  CDC 2008»
15 years 6 months ago
Structured semidefinite representation of some convex sets
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
J. William Helton, Jiawang Nie
APPML
2010
133views more  APPML 2010»
15 years 4 months ago
Fractional relaxation equations on Banach spaces
Abstract. We study existence and qualitative properties of solutions for the abstract fractional relaxation equation (0.1) u (t) - AD t u(t) + u(t) = f(t), 0 < < 1, t 0, u(...
Carlos Lizama, Humberto Prado