Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem. (C) 2009 ...
详细信息
Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem. (C) 2009 Elsevier B.V. All rights reserved.
A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c...
详细信息
A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c is an arbitrary positive constant. When is an arbitrary small posi-tive constant and u = log2 N, it is an O(logN) algorithm and when it is an optimal algorithm,pT = O(N log N)); where u = 1, c = 1 and e = 0.5 (a constant).
The slab design and optimization problem of hot rolling provides a foundation to implement mass customization. This paper addresses the problem assuming the demands have flexible requirement in slab width and weight. ...
详细信息
ISBN:
(纸本)9781424415304
The slab design and optimization problem of hot rolling provides a foundation to implement mass customization. This paper addresses the problem assuming the demands have flexible requirement in slab width and weight. A multi-objective optimizing model is built with equivalent weight, in which the weight and width of slab have interval values. A two-stage optimal algorithm is proposed to solve the model. The computational test shows the validity and effectiveness of the presented model and algorithm.
Existing optimal single constant multiplication (SCM) algorithms are limited to 19 bit constants. We propose an exact SCM algorithm. For 32 bit constants, the average run time is under 10 seconds. optimality is ensure...
详细信息
ISBN:
(纸本)9781450300025
Existing optimal single constant multiplication (SCM) algorithms are limited to 19 bit constants. We propose an exact SCM algorithm. For 32 bit constants, the average run time is under 10 seconds. optimality is ensured via an exhaustive search. The novelty of our algorithm is in how aggressive pruning is achieved by combining two SCM frameworks.
In wireless cellular network, users will share the time-slots channel and bandwidth with voice users. With the characteristic of dynamic slot allocation, some time slots can be allocated to one single user. How to cho...
详细信息
ISBN:
(纸本)9783037850695
In wireless cellular network, users will share the time-slots channel and bandwidth with voice users. With the characteristic of dynamic slot allocation, some time slots can be allocated to one single user. How to choose the slot allocation methodology is a significant problem when considering the system revenue and users' satisfaction. A new model based on improvement of Markov Decision Process) is developed that can combines the original maximum system revenue model and the call blocking constraints, and will find out the optimal policy of time slots allocation. The experiment result shows that the new algorithm and model is efficient in the channel assignment area of wireless networks.
We propose a new algorithm called Generic Cuts for computing optimal solutions to 2 label MRF-MAP problems with higher order clique potentials satisfying submodularity. The algorithm runs in time O(2(k)n(3)) in the wo...
详细信息
ISBN:
(纸本)9783642337147
We propose a new algorithm called Generic Cuts for computing optimal solutions to 2 label MRF-MAP problems with higher order clique potentials satisfying submodularity. The algorithm runs in time O(2(k)n(3)) in the worst case (k is clique order and n is the number of pixels). A special gadget is introduced to model flows in a high order clique and a technique for building a flow graph is specified. Based on the primal dual structure of the optimization problem the notions of capacity of an edge and cut are generalized to define a flow problem. We show that in this flow graph max flow is equal to min cut which also is the optimal solution to the problem when potentials are submodular. This is in contrast to all prevalent techniques of optimizing Boolean energy functions involving higher order potentials including those based on reductions to quadratic potential functions which provide only approximate solutions even for submodular functions. We show experimentally that our implementation of the Generic Cuts algorithm is more than an order of magnitude faster than all algorithms including reduction based whose outputs on submodular potentials are near optimal.
Recombination of sequences is an important combinatorial optimization problem due to its applications in computational biology. It is related to the alignment with recombination which is an edit distance problem invol...
详细信息
Recombination of sequences is an important combinatorial optimization problem due to its applications in computational biology. It is related to the alignment with recombination which is an edit distance problem involved recombination, and reconstructing a history of recombination from a set of sequences, etc. Recently, Wu and Gu discussed a distance problem involved recombination consisting of single crossover. [S. Wu and X. Gu (2001). A Greedy algorithm for optimal recombination. Proceeding of COCOON2001, Lecture Notes in Computer Science 2108 , pp. 86-90.] A and S denote two collections of sequences where \S\ = 2. The goal is to generate A from S by a series of recombinations in minimum number of steps. They defined a special class A of sequences called 'tree', and presented a greedy algorithm which was claimed optimal for finding the recombination distance from S to A. In this paper, we revisit this result. We show that the greedy algorithm is not always optimal, and propose a revised algorithm which can solve the problem optimally. We further propose a new class A of sequences called 'chain' and provide a polynomial time algorithm for finding the optimal recombination evolutionary history from S to A.
The proper design of the 4G LTE network, in order to provide sufficient capacity of high-quality coverage and efficient terminal traffic management, is of utmost importance. Therefore, the joint LTE wireless communica...
详细信息
ISBN:
(纸本)9781510835702
The proper design of the 4G LTE network, in order to provide sufficient capacity of high-quality coverage and efficient terminal traffic management, is of utmost importance. Therefore, the joint LTE wireless communications network design problem is modeled in this paper as an optimization problem. The mathematical programming problem in the model is a nonlinear, non-convex, mixed integer-programming problem. Lagrangean relaxation and subgradient method are adopted to solve those complex problems because Lagrangean relaxation is a powerful mathematical tool to solve large-scale linear and non-linear programming problems. In the computational results, the optimal algorithm achieves more improvements compared to other primal heuristics, which could demonstrate the effectiveness of Lagrangean approach.
It is well known that an optimal algorithm for logarithm query time and linear storage for two dimensional orthogonal range searches is nonexistent except for very few cases in which certain computational models have ...
详细信息
ISBN:
(纸本)9781424455652
It is well known that an optimal algorithm for logarithm query time and linear storage for two dimensional orthogonal range searches is nonexistent except for very few cases in which certain computational models have been assumed. A new algorithm called sliding kd tree is presented in this article where the length of the query box is fixed in any direction. The new algorithm is optimal in handling two-dimensional problems, and can be applied to VLSI Design Automations presented to show the performance of the SKD algorithm.
In comparison models for system-level fault diagnosis pairs of units are given the same job and results are compared. The result of such a comparison test can be 0 (match) or 1 (mismatch) and diagnosis is based on the...
详细信息
In comparison models for system-level fault diagnosis pairs of units are given the same job and results are compared. The result of such a comparison test can be 0 (match) or 1 (mismatch) and diagnosis is based on the collection of test results. Two such models have been studied, among others: the symmetric model of Chwa and Hakimi and the asymmetric model of Malek. We give worst case optimal testing algorithms for t-fault detection, sequential t-fault diagnosis, and one-step t-fault diagnosis in both models. We discuss nonadaptive and adaptive testing and show that the latter often enables us to decrease the number of tests.
暂无评论