90 search results - page 8 / 18 » A General Scheme for Multiple Lower Bound Computation in Con... |
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
MOBICOM
2009
ACM
14 years 1 months ago
2009
ACM
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
ISPD
2004
ACM
14 years 23 days ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
IWCMC
2009
ACM
14 years 1 months ago
2009
ACM
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
TIT
2002
13 years 7 months ago
2002
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...