Sciweavers

5153 search results - page 541 / 1031
» Introduction to Randomized Algorithms
Sort
View
DATE
2003
IEEE
93views Hardware» more  DATE 2003»
16 years 19 hour ago
Comparison of Test Pattern Decompression Techniques
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
Ondrej Novák
EVOW
2003
Springer
15 years 12 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
FCT
2003
Springer
15 years 12 months ago
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
Ivan Damgård, Gudmund Skovbjerg Frandsen
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
15 years 11 months ago
Christmas Gift Exchange Games
The Christmas gift exchange is a popular party game played around Christmas. Each participant brings a Christmas present to the party, and a random ordering of the participants, ac...
Arpita Ghosh, Mohammad Mahdian
168
Voted
SIGGRAPH
1994
ACM
15 years 10 months ago
FBRAM: a new form of memory optimized for 3D graphics
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
Michael F. Deering, Stephen A. Schlapp, Michael G....