Sciweavers

243 search results - page 21 / 49
» Linear Network Codes and Systems of Polynomial Equations
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 4 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
GECCO
1999
Springer
142views Optimization» more  GECCO 1999»
15 years 4 months ago
Towards Byte Code Genetic Programming
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
Brad Harvey, James A. Foster, Deborah A. Frincke
ICNP
2007
IEEE
15 years 6 months ago
Network Court Protocol and Malicious Node Conviction
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
Na Li, David Lee
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
15 years 8 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
ISCAS
2007
IEEE
108views Hardware» more  ISCAS 2007»
15 years 6 months ago
Optimal Synthesis of MITE Translinear Loops
— A procedure for synthesizing multiple-input translinear element (MITE) networks that implement a given system of translinear–loop equations (STLE) is presented. The minimum n...
Shyam Subramanian, David V. Anderson, Paul E. Hasl...