Sciweavers

866 search results - page 132 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
DAC
1996
ACM
14 years 1 months ago
Characterization and Parameterized Random Generation of Digital Circuits
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
Michael D. Hutton, Jerry P. Grossman, Jonathan Ros...
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
14 years 25 days ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 9 months ago
Best-Effort Strategies for Losing States
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
Marco Faella
CAGD
2007
75views more  CAGD 2007»
13 years 9 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
CORR
2007
Springer
108views Education» more  CORR 2007»
13 years 9 months ago
Scuba Search : when selection meets innovation
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
Sébastien Vérel, Philippe Collard, M...