14649 search results - page 338 / 2930 » Principles of problem solving |
154
click to vote
NIPS
2004
15 years 8 months ago
2004
Many interesting multiclass problems can be cast in the general framework of label ranking defined on a given set of classes. The evaluation for such a ranking is generally given ...
175
click to vote
CORR
2010
Springer
15 years 6 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...
135
click to vote
EOR
2006
15 years 6 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 ...
137
click to vote
MOC
2000
15 years 6 months ago
2000
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block fo...
173
click to vote
JCO
2002
15 years 6 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...