365 search results - page 8 / 73 » Solving the Multiplication Constraint in Several Approximati... |
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The problem of passive localization is commonly solved by independently measuring intermediate parameters (such as angles of arrival (AOA), times of arrival (TOA)...) on several m...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
TCS
2008
13 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...