Keyword: computational analysis

Found 489 papers in total
Stopping criteria for finite length genetic algorithms
Stopping criteria for finite length genetic algorithms
1996,
Considerable empirical results have been reported on the computational performance of...
Stochastic analysis of ‘simultaneous merge–sort’
Stochastic analysis of ‘simultaneous merge–sort’
1997,
The asymptotic behaviour of the recursion M k --> -->= --> -->d --> -->M...
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
1998,
The makespan problem on a single machine for a set of tasks with two distinct...
A polynomial-time approximation scheme for maximizing the minimum machine completion time
A polynomial-time approximation scheme for maximizing the minimum machine completion time
1997,
We consider the problem of assigning a set of n jobs to a system of m identical...
Linear-space algorithms that build local alignments from fragments
Linear-space algorithms that build local alignments from fragments
1995,
This paper presents practical algorithms for building an alignment of two long...
Fast algorithms for generalized predictive control
Fast algorithms for generalized predictive control
1994,
Fast algorithms for generalized predictive control (GPC) are derived by adopting an...
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996,
We propose an algorithm to solve the bottleneck spanning tree problem with an...
On the M/G/1 machine interference model with spares
On the M/G/1 machine interference model with spares
1996,
In this paper a recursive method is developed to obtain the steady state probability...
Synthesis of nonlinear state feedback control via extended quadratic Lyapunov function – convex analysis approach using linear matrix inequalities
Synthesis of nonlinear state feedback control via extended quadratic Lyapunov function – convex analysis approach using linear matrix inequalities
1997,
We show a synthesis method of nonlinear state feedback control for input-affine...
An algorithm for solving the multi-dimensional rectangle cover problem and satisfiability problem
An algorithm for solving the multi-dimensional rectangle cover problem and satisfiability problem
1997,
We consider the problem of asking whether a given d-dimensional rectangle R o is...
Necessary and sufficient conditions for global geometric convergence of block Gauss–Seidel iteration algorithm applied to Markov chains
Necessary and sufficient conditions for global geometric convergence of block Gauss–Seidel iteration algorithm applied to Markov chains
1997,
Convergence properties of the block Gauss–Seidel algorithm applied to ergodic...
An algorithm of finding all solutions with guaranteed accuracy for parameter dependent nonlinear equations
An algorithm of finding all solutions with guaranteed accuracy for parameter dependent nonlinear equations
1997,
In this paper, an algorithm is proposed for finding all solutions with guaranteed...
The generalized stable set problem for perfect bidirected graphs
The generalized stable set problem for perfect bidirected graphs
1997,
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we...
A three step quadratically convergent version of primal affine scaling method
A three step quadratically convergent version of primal affine scaling method
1997,
In this paper we consider the primal affine scaling method and show that,...
A note on reducing the number of variables in Integer Programming problems
A note on reducing the number of variables in Integer Programming problems
1997,
A necessary and sufficient condition for identification of dominated columns, which...
A truncated exponential algorithm for the lightly constrained assignment problem
A truncated exponential algorithm for the lightly constrained assignment problem
1997,
This paper presents a truncated branch-and-bound algorithm to obtain a near optimal...
On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
1997,
This paper considers the number of inner iterations required per outer iteration for...
Metric-based symmetric rank-one updates
Metric-based symmetric rank-one updates
1997,
Metric-based symmetric rank-one (SR1) updates which are stabilized by a variational...
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
1995,
Two algorithms are presented for the asymmetric travelling salesman problem. The worst...
Two-stage no-wait scheduling models with setup and removal times separated
Two-stage no-wait scheduling models with setup and removal times separated
1997,
This paper studies two models of two-stage processing with no-wait in process. The...
Pseudopolynomial algorithms for CTV minimization in single machine scheduling
Pseudopolynomial algorithms for CTV minimization in single machine scheduling
1997,
The problem of scheduling jobs on a single machine so as to minimize completion time...
Complexity of the single vehicle scheduling problem on graphs
Complexity of the single vehicle scheduling problem on graphs
1997,
Let G = ( V , E ) be a graph. The travel times w ( u , v ) and w ( v , u ) are...
Algorithms for dense graphs and networks on random-access computers
Algorithms for dense graphs and networks on random-access computers
1996,
We improve upon the running time of several graph and network algorithms when applied...
Simple local search problems that are hard to solve
Simple local search problems that are hard to solve
1991,
Many algorithms for NP-hard optimization problems find solutions that are locally...
Papers per page: