13987 search results - page 168 / 2798 » The Two Guards Problem |
130
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
EOR
2006
15 years 3 months ago
2006
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is ...
113
Voted
COMPUTING
2007
15 years 3 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
124
Voted
IPL
2007
15 years 3 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
126
Voted
TCS
2008
15 years 3 months ago
2008
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...