Found 97029 papers in total
Improved processor bounds for combinatorial problems in RNC
1988,
The authors’ main result improves the known processor bound by a factor of n 4 (maintaining the...
Computing the bump number is easy
1988,
The bump number b ( P ) of a partial order P is the minimum number of comparable adjacent pairs in some...
A common schema for dynamic programming and branch and bound algorithms
1989,
A new model for dynamic programming and branch and bound algorithms is presented. The model views these...
A provably efficient algorithm for dynamic storage allocation
1989,
The design and analysis of algorithms for on-line dynamic storage allocation has been a fundamental...
Algorithms and data structures for an expanded family of matroid intersection problems
1989,
Consider a matroid or rank n in which each element has a real-valued cost and one of d >1 colors. A...
Intersection of two matroids: (Condensed) border graphs and ranking
1989,
Given two matroids M 1 =( E ,ℐ 1 ) and M 2 =( E ,ℐ 2 ), three algorithms for finding K best...
Approximation algorithms for scheduling arithmetic expression on pipelined machines
1989,
Consider a processor which can issue one instruction every machine cycle, but can use its result only d...
The time complexity of maximum matching by simulated annealing
1988,
The random, heuristic search algorithm called simulated annealing is considered for the problem of finding...
Worst-case growth rates of some classical problems of combinatorial optimization
1989,
A method is presented for determining the asymptotic worst-case behavior of quantities like the length of...
Bin packing with restricted piece sizes
1989,
Coffman et al. have recently shown that a large number of bin-packing problems can be solved in polynomial...
An O(Nlog2N) algorithm for the maximum weighted tardiness problem
1989,
The authors give an O( n log 2 n ) algorithm which solves the scheduling problem of minimizing the maximum...
A constructive proof of a permutation-based generalization of Sperner’s lemma
1989,
In a recent paper, Gale has given an interesting generalization of the KKM lemma in combinatorial...
Decomposition and optimization over cycles in binary matroids
1989,
For k =2 and 3, the authors define several k- sums of binary matroids and of polytopes arising from...
Average-case analysis of the Smart Next Fit algorithm
1989,
This paper, presents the Smart Next Fit algorithm for on-line bin packing, which is obtained by slightly...
A parallel algorithm for finding a blocking flow in an acyclic network
1989,
The authors propose a simple parallel algorithm for finding a blocking flow in an acyclic network. On an...
Probabilistic analysis of a heuristics for the dual bin packing problem
1989,
In this paper the authors study the probabilistic behavior of the first fit increasing heuristics for the...
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
1989,
An algorithm is presented for finding a Hamiltonian cycle in 4-connected planar graphs. The algorithm uses...
The parallel complexity of TSP Heuristics
1989,
The authors consider eight heuristics for constructing approximate solutions to the traveling salesman...
An O(nlogn) algorithm for the all-nearest-neighbors problem
1989,
Given a set V of n points in k -dimensional space, and an L q -metric (Minkowski metric), the...
Algorithms using a branch and bound method for finding all real solutions to an equation of one variable
1989,
This paper, proposes algorithms using a branch and bound method for finding all real solutions to an...
Asymptotic behaviour of optimal control systems with low discount rates
1989,
Let x be the path and u the control that maximizes the cumulative return discounted at rate δ . The...
Qualities of good software and software-packages, in quantitative methods for decision making
1988,
Different authors, and even groups of authors or users have tried to evaluate many software packages....
Coherence between quantitative and qualitative assessments: A case study and its generalized formal model
1988,
This paper compares and analyses the quantitative and the qualitative assessments in a context of a...
Choosing between risky prospects: The characterization of comparative statics results, and location independent risk
1989,
This paper considers expected utility maximizers choosing from a family of risky prospects and examines...
Papers per page:

Paper Filter