Sciweavers

971 search results - page 179 / 195
» Approximate Satisfiability and Equivalence
Sort
View
FCCM
2006
IEEE
125views VLSI» more  FCCM 2006»
15 years 5 months ago
A Multithreaded Soft Processor for SoPC Area Reduction
The growth in size and performance of Field Programmable Gate Arrays (FPGAs) has compelled System-on-aProgrammable-Chip (SoPC) designers to use soft processors for controlling sys...
Blair Fort, Davor Capalija, Zvonko G. Vranesic, St...
ISCAS
2006
IEEE
121views Hardware» more  ISCAS 2006»
15 years 5 months ago
A frequency domain based TEQ design for DSL systems
that the equivalent channel is approximately an impulse. In [7], Martin et al. propose a globally convergent blind adap-In this paper, we propose a frequency domain based de- tive ...
Yuan-Pei Lin, Yu-Pin Lin, See-May Phoong
SIGCOMM
2004
ACM
15 years 5 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown
RTAS
2003
IEEE
15 years 5 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 5 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...