Sciweavers

43 search results - page 4 / 9
» Biconnectivity on Symbolically Represented Graphs: A Linear ...
Sort
View
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 1 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
IJES
2006
72views more  IJES 2006»
14 years 9 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
IPPS
1998
IEEE
15 years 1 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
ICC
2007
IEEE
129views Communications» more  ICC 2007»
15 years 3 months ago
A Factor Graph Approach to the Iterative Detection of OFDM Signals in the Presence of Carrier Frequency Offset and Phase Noise
—This paper provides a new iterative solution to the problem of the joint estimation of phase noise and residual carrier frequency offset in an orthogonal frequency division mult...
Filippo Zuccardi Merli, Giorgio Matteo Vitetta
ICTAI
2009
IEEE
15 years 4 months ago
Evolution Strategies for Constants Optimization in Genetic Programming
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
César Luis Alonso, José Luis Monta&n...