4934 search results - page 390 / 987 » complexity 2008 |
204
click to vote
CISS
2008
IEEE
16 years 2 months ago
2008
IEEE
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
195
click to vote
DATE
2008
IEEE
16 years 2 months ago
2008
IEEE
As levels of parallelism are becoming increasingly complex in multiprocessor architectures, GALS, and asynchronous circuits, methodologies and software tools are needed to verify ...
210
click to vote
DEXAW
2008
IEEE
16 years 2 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
189
click to vote
DSD
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, a methodology for generating VHDL descriptions of hardware checkers is presented. It is shown how the methodology can be used to generate on-line checkers of commun...
207
click to vote
EDOC
2008
IEEE
16 years 2 months ago
2008
IEEE
Business processes used in networked business are often large and complex, which makes them difficult to manage and change. In this paper we address this lack of flexibility by pr...