Keyword: computational analysis

Found 489 papers in total
Linear programming, complexity theory and elementary functional analysis
Linear programming, complexity theory and elementary functional analysis
1995,
The paper proposes analyzing interior-point methods using notions of problem-instance...
On the complexity of solving feasible systems of linear inequalities specified with approximate data
On the complexity of solving feasible systems of linear inequalities specified with approximate data
1995,
An algorithm that gives an approximate solution of a desired accuracy to a system of...
A unifying geometric solution framework and complexity analysis for variational inequalities
A unifying geometric solution framework and complexity analysis for variational inequalities
1995,
In this paper, the authors propose a concept of polynomiality for variational...
The curvature integral nad the complexity of linear complementarity problems
The curvature integral nad the complexity of linear complementarity problems
1995,
In this paper, the authors propose a predictor-corrector-type algorithm for solving...
The complexity of approximating a nonlinear program
The complexity of approximating a nonlinear program
1995,
The authors consider the problems of finding the maximum of a multivariate polynomial...
Pure adaptive search for finite global optimization
Pure adaptive search for finite global optimization
1995,
Pure Adaptive Search is a stochastic algorithm which has been analyzed for continuous...
A Monge property for the d-dimensional transportation problem
A Monge property for the d-dimensional transportation problem
1995,
In 1963, Hopman gave necessary and sufficient conditions under which a family of O(...
Forecasting with STAMP
Forecasting with STAMP
1996,
Structural Time Series Analyser, Modeller and Predictor (STAMP) is a package design...
Graph theoretical issues in computer networks
Graph theoretical issues in computer networks
1993,
Recently computer networks have become one of the main topics of research in computer...
Estimating the mean completion time of PERT networks with exponentially distributed durations of activities
Estimating the mean completion time of PERT networks with exponentially distributed durations of activities
1993,
In order to compute the exact values of the characteristics for PERT networks with...
Alternating paths in edge-colored complete graphs
Alternating paths in edge-colored complete graphs
1995,
In an edge-colored graph, the paper says that a path is alternating if it has at least...
The complexity of harmonious colouring for trees
The complexity of harmonious colouring for trees
1995,
A harmonious colouring of a simple graph G is a proper vertex colouring such that each...
Expected complexity of graph partitioning problems
Expected complexity of graph partitioning problems
1995,
The paper studies the expected time complexity of two graph partitioning problems: the...
The NP-completeness of finding A-trials in Eulerian graphs and of finding spanning trees in hypergraphs
The NP-completeness of finding A-trials in Eulerian graphs and of finding spanning trees in hypergraphs
1995,
Samuel W. Bent and Udi Manber have shown that it is NP-complete to decide whether a...
On the k-coloring of intervals
On the k-coloring of intervals
1995,
The problem of coloring a set of n intervals (from the real line) with a set of k...
A note on the strong polynomiality of convex quadratic programming
A note on the strong polynomiality of convex quadratic programming
1995,
The authors prove that a general convex quadratic program (QP) can be reduced to the...
A strongly polynomial algorithm for the transportation problem
A strongly polynomial algorithm for the transportation problem
1995,
For the (linear) transportation problem with m supply nodes, n demand nodes and k...
Regularity of matrices in min-algebra and its time-complexity
Regularity of matrices in min-algebra and its time-complexity
1995,
Let be a linearly ordered, commutative group and be defined by for all . Extend to...
A random polynomial time algorithm for well-rounding convex bodies
A random polynomial time algorithm for well-rounding convex bodies
1995,
The authors present a random polynomial time algorithm for well-rounding convex bodies...
Recognizing renamable generalized propositional Horn formulas is NP-complete
Recognizing renamable generalized propositional Horn formulas is NP-complete
1995,
Yamasaki and Doshita (1983) have defined an extension of the class of propositional...
NP-hardness of shop-scheduling problems with three jobs
NP-hardness of shop-scheduling problems with three jobs
1995,
This paper deals with the problem of scheduling n jobs on m machines in order to...
Using the generalized dynamic-programming theory to calculate determinants and invert matrices
Using the generalized dynamic-programming theory to calculate determinants and invert matrices
1995,
Algorithms for high-precision calculation of determinants and inversion of matrices...
A view of interior point methods for linear programming
A view of interior point methods for linear programming
1995,
The paper gives a view of interior point methods for linear programming inspired by...
On the worst case performance of TESSA
On the worst case performance of TESSA
1996,
TESSA is a facility layout heuristic for obtaining a maximal planar adjacency graph...
Papers per page: