1080 search results - page 32 / 216 » Problem dependent optimization (PDO) |
168
click to vote
IWPEC
2009
Springer
16 years 29 days ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
148
click to vote
COCOON
2007
Springer
16 years 17 days ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
170
click to vote
FCCM
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper proposes a high performance least square solver on FPGAs using the Cholesky decomposition method. Our design can be realized by iteratively adopting a single triangular...
201
click to vote
TIT
1998
15 years 6 months ago
1998
—In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature of the ...
155
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...