133 search results - page 20 / 27 » Re-seeding invalidates tests of random number generators |
ASPDAC
1995
ACM
15 years 1 months ago
1995
ACM
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
65
Voted
AIR
2004
14 years 9 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
AAAI
1994
14 years 11 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
EMSOFT
2009
Springer
15 years 4 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...