Sciweavers

7773 search results - page 57 / 1555
» On generalized Frame-Stewart numbers
Sort
View
AI
1998
Springer
13 years 7 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
DAC
2010
ACM
13 years 11 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
FPGA
2008
ACM
146views FPGA» more  FPGA 2008»
13 years 9 months ago
FPGA-optimised high-quality uniform random number generators
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
David B. Thomas, Wayne Luk
AMC
2010
126views more  AMC 2010»
13 years 7 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos
JC
2007
130views more  JC 2007»
13 years 7 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner