3250 search results - page 150 / 650 » An Algorithm to Solve a Linear Program |
179
click to vote
MANSCI
2007
15 years 6 months ago
2007
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
192
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
160
click to vote
ISSAC
2005
Springer
16 years 9 days ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
158
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
176
click to vote
ICALP
2004
Springer
16 years 5 days ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...