3250 search results - page 116 / 650 » An Algorithm to Solve a Linear Program |
123
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
92
Voted
MP
2007
15 years 2 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
124
Voted
MP
2008
15 years 2 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
133
Voted
CAV
2003
Springer
15 years 7 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...