Sciweavers

494 search results - page 12 / 99
» Polynomial Equivalence Problems: Algorithmic and Theoretical...
Sort
View
FOCS
1992
IEEE
15 years 3 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
15 years 5 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
Namrata Shekhar, Priyank Kalla, Florian Enescu
MFCS
2004
Springer
15 years 5 months ago
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of ā€œspecial aspectsā€ to the problems encountered. Hence, the study of paramet...
Rolf Niedermeier
84
Voted
CEC
2005
IEEE
15 years 5 months ago
On the convergence of multi-parent genetic algorithms
Abstract— This paper presents a Markov model for the convergence of multi-parent genetic algorithms (MPGAs). The proposed model formulates the variation of gene frequency caused ...
Chuan-Kang Ting
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
15 years 6 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....