Sciweavers

5153 search results - page 582 / 1031
» Introduction to Randomized Algorithms
Sort
View
CAV
2009
Springer
132views Hardware» more  CAV 2009»
16 years 7 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
DCC
2005
IEEE
16 years 6 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
137
Voted
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
16 years 3 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
158
Voted
EVOW
2009
Springer
16 years 1 months ago
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go
This paper presents a successful application of parallel (grid) coevolution applied to the building of an opening book (OB) in 9x9 Go. Known sayings around the game of Go are refou...
Pierre Audouard, Guillaume Chaslot, Jean-Baptiste ...
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
16 years 1 months ago
Incorporating graceful degradation into embedded system design
In this work, the focus is put on the behavior of a system in case a fault occurs that disables the system from executing its applications. Instead of executing a random subset of...
Michael Glaß, Martin Lukasiewycz, Christian ...