14518 search results - page 189 / 2904 » Two Problems for Sophistication |
IPL
2007
15 years 17 days 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 ...
102
Voted
TCS
2008
15 years 17 days 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...
128
Voted
EJC
2000
15 years 15 days ago
2000
Given an affine surjection of polytopes : P Q, the Generalized Baues Problem asks whether the poset of all proper polyhedral subdivisions of Q which are induced by the map has t...
106
Voted
JCO
2002
15 years 10 days 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...
118
Voted
MOC
2002
15 years 10 days ago
2002
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...