Sciweavers

7930 search results - page 1285 / 1586
» Greedy in Approximation Algorithms
Sort
View
FPL
2005
Springer
98views Hardware» more  FPL 2005»
15 years 10 months ago
Using DSP Blocks For ROM Replacement: A Novel Synthesis Flow
This paper describes a method based on polynomial approximation for transferring ROM resources used in FPGA designs to multiplication and addition operations. The technique can be...
Gareth W. Morris, George A. Constantinides, Peter ...
GECCO
2005
Springer
134views Optimization» more  GECCO 2005»
15 years 10 months ago
Tracking extrema in dynamic environments using a coevolutionary agent-based model of genotype edition
Typical applications of evolutionary optimization in static environments involve the approximation of the extrema of functions. For dynamic environments, the interest is not to lo...
Chien-Feng Huang, Luis Mateus Rocha
HPCC
2005
Springer
15 years 10 months ago
Detonation Structure Simulation with AMROC
Abstract. Numerical simulations can be the key to the thorough understanding of the multi-dimensional nature of transient detonation waves. But the accurate approximation of realis...
Ralf Deiterding
KES
2005
Springer
15 years 10 months ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 10 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
« Prev « First page 1285 / 1586 Last » Next »