Sciweavers

4485 search results - page 853 / 897
» Equivalences on Observable Processes
Sort
View
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ICPP
2002
IEEE
14 years 1 months ago
Software Caching using Dynamic Binary Rewriting for Embedded Devices
A software cache implements instruction and data caching entirely in software. Dynamic binary rewriting offers a means to specialize the software cache miss checks at cache miss t...
Chad Huneycutt, Joshua B. Fryman, Kenneth M. Macke...
ISSS
2002
IEEE
127views Hardware» more  ISSS 2002»
14 years 1 months ago
Dynamic Common Sub-Expression Elimination during Scheduling in High-Level Synthesis
We introduce a new approach, “Dynamic Common Sub-expression Elimination (CSE)”, that dynamically eliminates common sub- expressions based on new opportunities created during s...
Alexandru Nicolau, Nikil D. Dutt, Rajesh Gupta, Ni...
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
14 years 1 months ago
Investigating whether hyperNEAT produces modular neural networks
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
Jeff Clune, Benjamin E. Beckmann, Philip K. McKinl...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
14 years 1 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga