2485 search results - page 46 / 497 » Time Bounded Frequency Computations |
124
click to vote
TPDS
1998
15 years 3 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
138
click to vote
CPM
2010
Springer
15 years 9 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
155
click to vote
RTSS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Many embedded platforms consist of a heterogeneous collection of processing elements, memory modules, and communication subsystems. These components often implement diff...
131
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
148
click to vote
MP
2002
15 years 3 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...