Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including th...

Although Minimum Distance Parsing (MDP) offers a theoretically attractive solution to the problem of extragrammaticality, it is often computationally infeasible in large scale practical applications. In this paper we present an alternative approach where the labor is distributed between a more restrictive partial parser and a repair module. Though two stage approaches have grown in popularity i...

In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O∗(2 K 6.2158 ) for Max2-Sat (each clause contains at most 2 literals), where K is the number of clauses. The run time has been achieved by using heuristic priorities on the choice of the variable on which we branch. The imple...

This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches. A placement algorithm usually takes a list of shapes, sorted by some property such as increasing height or decreasing area, and then applies a placement rule to each of these shapes in turn. The proposed met...

Available online 18 August 2009

In recent numerical simulations of spherically symmetric gravitational collapse a new type of critical behaviour, dominated by a sphaleron solution, has been found. In contrast to the previously studied models, in this case there is a finite gap in the spectrum of black-hole masses which is reminiscent of a first order phase transition. We briefly summarize the essential features of this phase ...

The analytic signal is one of the most capable approaches in onedimensional signal processing. Two-dimensional signal theory suffers from the absence of an isotropic extension of the analytic signal. Accepting the fact that there is no odd filter with isotropic energy in higher dimensions, one tried to circumvent this drawback using the one-dimensional quadrature filters with respect to several...

We study equilibrium droplets in two-phase systems at parameter values corresponding to phase coexistence. Specifically, we give a self-contained microscopic derivation of the Gibbs–Thomson formula for the deviation of the pressure and the density away from their equilibrium values which, according to the interpretation of the classical thermodynamics, appears due to the presence of a curved in...

The minimum common string partition problem is an NP-hard combinatorial optimization problem with applications in computational biology. In this work we propose the first integer linear programming model for solving this problem. Moreover, on the basis of the integer linear programming model we develop a deterministic 2-phase heuristic which is applicable to larger problem instances. The result...

In this paper, we propose the first heuristic approach for the vertex separator problem (VSP), based on Breakout Local Search (BLS). BLS is a recent meta-heuristic that follows the general framework of the popular Iterated Local Search (ILS) with a particular focus on the perturbation strategy. Based on some relevant information on search history, it tries to introduce the most suitable degree ...