Sciweavers

210 search results - page 29 / 42
» Error bounds for mixed integer linear optimization problems
Sort
View
SPAA
2006
ACM
15 years 3 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
TMC
2002
106views more  TMC 2002»
14 years 9 months ago
Optimal Resource Management in Wireless Multimedia Wideband CDMA Systems
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...
Majid Soleimanipour, Weihua Zhuang, George H. Free...
94
Voted
SARA
2009
Springer
15 years 4 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
FPGA
1997
ACM
127views FPGA» more  FPGA 1997»
15 years 1 months ago
General Modeling and Technology-Mapping Technique for LUT-Based FPGAs
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...
Amit Chowdhary, John P. Hayes
ICA
2007
Springer
15 years 3 months ago
Two Improved Sparse Decomposition Methods for Blind Source Separation
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
B. Vikrham Gowreesunker, Ahmed H. Tewfik