Sciweavers

1070 search results - page 183 / 214
» Type Classes with Functional Dependencies
Sort
View
INFOCOM
2002
IEEE
14 years 17 days ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
DEXA
2000
Springer
99views Database» more  DEXA 2000»
13 years 12 months ago
The BORD Benchmark for Object-Relational Databases
This paper describes a new benchmark for object-relational DBMSs, the Benchmark for Object-Relational Databases (BORD). BORD has been developed to evaluate system performance pecul...
Sang Ho Lee, Sung Jin Kim, Won Kim
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
13 years 12 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
FOCS
1999
IEEE
13 years 12 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
EVOW
1994
Springer
13 years 11 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay