2693 search results - page 441 / 539 » On Computing Complex Navigation Functions |
171
click to vote
QEST
2009
IEEE
16 years 1 months ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
157
click to vote
EUROGP
2009
Springer
16 years 25 days ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
146
click to vote
FMCAD
2009
Springer
16 years 25 days ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
161
click to vote
FSTTCS
2009
Springer
16 years 25 days ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
192
click to vote
IWSEC
2009
Springer
16 years 25 days ago
2009
Springer
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...