Sciweavers

2018 search results - page 208 / 404
» Code Normal Forms
Sort
View
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
15 years 11 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
MDM
2004
Springer
15 years 11 months ago
Mobile Agents: Ten Reasons For Failure
Mobile agents have often been advocated as the solution to the problem of designing and implementing distributed applications in a dynamic environment. Mobile agents provide a ver...
Giovanni Vigna
IPPS
1998
IEEE
15 years 10 months ago
Synthesis of a Systolic Array Genetic Algorithm
The paper presents the design of a hardware genetic algorithm which uses a pipeline of systolic arrays. Demostrated is the design methodology, where a simple genetic algorithm exp...
Graham M. Megson, I. M. Bland
JMLC
1997
Springer
15 years 10 months ago
Lightweight Parametric Polymorphism for Oberon
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports ...
Paul Roe, Clemens A. Szyperski
CSEE
2007
Springer
15 years 10 months ago
Exploiting Multiplicity to Teach Reliability and Maintainability in a Capstone Project
Many, if not most, Computer Science programs contain some form of capstone, or senior, project as a key requirement in receiving a bachelor's degree in Computer Science or So...
Janet E. Burge