3250 search results - page 130 / 650 » An Algorithm to Solve a Linear Program |
152
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
161
Voted
CCE
2010
15 years 2 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
110
Voted
MOC
2000
15 years 4 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...
117
click to vote
SUM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
115
Voted
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for ex...