3096 search results - page 285 / 620 » The Generalized FITC Approximation |
176
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
158
click to vote
ALMOB
2006
15 years 6 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
184
click to vote
ISCI
2008
15 years 6 months ago
2008
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
167
click to vote
DAM
2007
15 years 6 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
172
click to vote
TIT
2008
15 years 6 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...