Sciweavers

3367 search results - page 391 / 674
» Incremental assignment problem
Sort
View
FOCS
2002
IEEE
15 years 9 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
INFOCOM
2002
IEEE
15 years 9 months ago
Exploiting OTDM technology in WDM networks
— Wavelength routed optical networks allow to design a logical topology, comprising lightpaths and routers, which is overlayed on the physical topology, comprising optical fiber...
Marco Mellia, Emilio Leonardi, Marco Feletig, Robe...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 9 months ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
165
Voted
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 9 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
15 years 9 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...