Die weite Verbreitung der fensterorientierten Benutzerschnittstelle führt zu einem zunehmend intensiven Gebrauch der Fenstertechnik durch komplexe Softwaresysteme etwa in den Bereichen Hypertext oder CAx. Der Ben...
详细信息
Roelants van Baronaigien (1991) gave an algorithm to generate all n-node binary tree representations with constant time between them. He used the well-known rotation operation on nodes for balancing binary search tree...
详细信息
Roelants van Baronaigien (1991) gave an algorithm to generate all n-node binary tree representations with constant time between them. He used the well-known rotation operation on nodes for balancing binary search trees and represented binary trees by binary tree sequences. This paper generalizes the rotation to k-ary trees and uses it to generate k-ary tree representations with constant time between them.
A new fully polynomial approximation scheme for the subset-sum problem is presented. This algorithm yields better time and space complexity bounds, and also tends to improve the practicability of the procedure. The su...
详细信息
A new fully polynomial approximation scheme for the subset-sum problem is presented. This algorithm yields better time and space complexity bounds, and also tends to improve the practicability of the procedure. The subset-sum problem, for n items and accuracy epsilon is solved in O(min(n/epsilon, n + 1/epsilon3)) time and O(min(n/epsilon, n + 1/epsilon2)) space.
The part-nesting problem is the problem of arranging a set of two-dimensional irregular shapes, the parts on a plane irregularly shaped surface, such that no shapes overlap and as much of the surface is covered as pos...
详细信息
ISBN:
(纸本)0898713137
The part-nesting problem is the problem of arranging a set of two-dimensional irregular shapes, the parts on a plane irregularly shaped surface, such that no shapes overlap and as much of the surface is covered as possible. This problem occurs in several applications in the textile business. One of the most challenging applications appear in the leather industry. This application is characterized by a high degree of inhomogeneity of the surface as well as the shapes and by severe restrictions on run time. We present an algorithmic method for computer-aided nesting in this context. The algorithm is characterized by selective data reduction, sequential part placement, a topological part fitting process, and a carefully tuned evaluation function for partial placements. Experiments show that the method is competitive with nestings done by man, for relatively nicely behaved part sets and surfaces. Our nesting algorithm has been in industrial use since June 1992.
Some variants of the classical problem of Towers of Hanoi incorporating new pragmatic constraints are considered. The classical problem is extended to the multi-peg case. A batched online variant is also proposed. The...
详细信息
Some variants of the classical problem of Towers of Hanoi incorporating new pragmatic constraints are considered. The classical problem is extended to the multi-peg case. A batched online variant is also proposed. The case wherein not all disks are distinct is also considered. Recursive algorithms for solving variants of the Towers of Hanoi problem incorporating one or more of the above constraints are proposed and their optimality properties are discussed.
This paper introduces a generalization of the simulated annealing algorithm for global optimization. Simulated annealing has been successfully applied to a number of combinatorial and continuous optimization problems....
详细信息
This paper introduces a generalization of the simulated annealing algorithm for global optimization. Simulated annealing has been successfully applied to a number of combinatorial and continuous optimization problems. The original approach has been significantly improved by introducing adaptive annealing schedules and annealing several copies of the problem in parallel. In this paper we make a further step and propose a generalized simulated annealing algorithm called Demon Algorithm. This algorithm is constructed in analogy to the action of Maxwell's Demon and has been motivated by an information-theoretic analysis of simulated annealing. The algorithm is based on an ensemble of identical systems that are annealed in parallel. The ensemble evolves according to a sequence of target distributions with the aim to end up in a distribution that is concentrated on optimal solutions. The evolution of the ensemble is based on collective moves. The algorithm is implemented for the problem of graph bipartitioning and its performance is compared with conventional simulated annealing and a downhill search algorithm.
Finding spatial regularity in images is important in military applications (e.g., finding rows of landmines), texture analysis, and other areas. We give an optimal THETA(n2) algorithm for finding all maximal equally-s...
详细信息
Finding spatial regularity in images is important in military applications (e.g., finding rows of landmines), texture analysis, and other areas. We give an optimal THETA(n2) algorithm for finding all maximal equally-spaced collinear subsets within a pointset in E(d). We also generalize this method to yield an optimal THETA(n3) algorithm for determining all maximal regular coplanar lattices.
暂无评论