Results 281 to 290 of about 2,188,345 (345)

The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. [PDF]

Algorithmica
Dang DC, Lehre PK.
europepmc   +1 more source

Semiparametric Joint Modeling for Survival Analysis with Longitudinal Covariates. [PDF]

J Am Stat Assoc
Guo W, Wang T.
europepmc   +1 more source

Polynomial primal-dual affine scaling algorithms in semidefinite programming.

Klerk, E. de, Roos, C., Terlaky, T.
core  

A new polynomial-time algorithm for linear programming

Combinatorica, 1984
This paper discusses a new polynomial time algorithm for linear programming (LP). It is an interior point method whose worst case computational complexity is \(0(n^{3.5}L)\) arithmetic operations on 0(L) bit numbers, where n is the number of variables and L is the number of bits in the input.
N. Karmarkar
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A Polynomial Time Algorithm For Fault Diagnosability

25th Annual Symposium onFoundations of Computer Science, 1984., 1984
We present the first polynomial time algorithm for testing t-diagnosability. This is a significant advance in system level fault diagnosis. We also presented part of our analysis of t/s-diagnosability, including the fact that it is co-NP-complete and that there are polynomial algorithms for t/t and t/(t+1)-diagnosability.
G. Sullivan
openaire   +2 more sources