Sciweavers

590 search results - page 41 / 118
» Resolution-stationary random number generators
Sort
View
VTS
1995
IEEE
94views Hardware» more  VTS 1995»
15 years 8 months ago
Synthesis of locally exhaustive test pattern generators
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
Günter Kemnitz
ECOOP
2007
Springer
15 years 8 months ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
ICPP
2005
IEEE
15 years 10 months ago
A Task Duplication Based Scheduling Algorithm Using Partial Schedules
We propose a novel replication-based two-phase scheduling algorithm designed to achieve DAG scheduling with small makespans and high efficiency. In the first phase, the schedule...
Doruk Bozdag, Füsun Özgüner, Eylem ...
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
15 years 8 months ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
EUROCRYPT
2001
Springer
15 years 9 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley