3221 search results - page 271 / 645 » Termination of Linear Programs |
162
click to vote
WSC
2007
15 years 8 months ago
2007
This paper addresses several issues of using the mathematical programming representations of discrete-event dynamic systems in perturbation analysis. In particular, linear program...
158
click to vote
ORL
1998
15 years 6 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
174
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
213
click to vote
KDD
2004
ACM
15 years 12 months ago
2004
ACM
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
181
click to vote
PVM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Today’s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data struc...