One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

abstract introduction: self-esteem is one of the necessities of human life and most professionals consider it as a major factor in social and emotional adjustment. low self-esteem in students causes academic failure, loneliness, drug abuse, away from reality and self-destructive behaviors. objective: this study aimed to determine the level of self-esteem and its related factors in high school s...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

Using data from the 2008 University of California Undergraduate Experience Survey, we show that study time and academic conscientiousness were lower among students in humanities and social science majors than among students in science and engineering majors. Analytical and critical thinking experiences were no more evident among humanities and social sciences majors than among science and engin...

In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key matrix inequality. Concerning the error exponents, the upper bounds lead to noncommutative analogues of the Chernoff bound and the Hoeffding bound, which are identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. Ou...

Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a network so that the expected demand covered is maximized, where ...

This paper considers the problem of finding the global optimum of the camera rotation, translation and the focal length given a set of 2D–3D point pairs. The global solution is obtained under the L-infinity optimality by a branch-and-bound algorithm. To obtain the goal, we firstly extend the previous branch-andbound formulation and show that the image space error (pixel distance) may be used in...

This work provides exponential tail inequalities for sums of random matrices that depend only on intrinsic dimensions rather than explicit matrix dimensions. These tail inequalities are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit matrix dimensions replaced by a trace quantity that can be small even when the explicit dimensions are large...

The problem of integer programming in bounded variables, over constraints with no more than two variables in each constraint is NP-complete, even when all variables are binary. This paper deals with integer linear minimization problems in n variables subject to m linear constraints with at most two variables per inequality, and with all variables bounded between 0 and U. For such systems, a 2?a...

In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, there...