Default unification operations combine strict information with information from one or more defeasible feature structures. Many such operations require finding the maximal subsets of a set of atomic constraints which are consistent with each other and with the strict feature structure, where a subset is maximally consistent with respect to the subsumption ordering if no constraint can be added ...

This paper addresses the compile-time optimization of a form of nested-loop computation that is motivated by a computational physics application. The computations involve multi-dimensional surface and volume integrals where the integrand is a product of a number of array terms. Besides the issue of optimal distribution of the arrays among the processors, there is also scope for reordering of th...

A new class of algorithms based on the triangle inequality has recently been proposed for use in contentbased image retrieval. These algorithms rely on comparing a set of key images to the database images, and storing the computed distances. Query images are later compared to the keys, and the triangle inequality is used to speedily compute lower bounds on the distance from the query to each of...

Pretropisms are candidates for the leading exponents of Puiseux series that represent positive dimensional solution sets of polynomial systems. We propose a new algorithm to both horizontally and vertically prune the tree of edges of a tuple of Newton polytopes. We provide experimental results with our preliminary implementation in Sage that demonstrates that our algorithm compares favorably to...

In saliency based pruning algorithms a pruning decision is made based on an ordering of the parameters. We will in this article focus on the fact that this ordering is invariant under certain transformations, and with that knowledge an equivalence class of algorithms is developed all yielding identical prunings. A sub-class is demonstrated to have a simple but sensible interpretation in terms o...

In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth. Our experiments with verified null-move pruning show that on averag...

This Supplementary Information further describes the methods used in DEEPer by providing additional details and proofs. Section A proves the validity of the indirect pruning algorithms, Algorithms 1 (proved in A.1) and 2 (in A.2), and derives their time complexity (A.3). Section B describes some details of implementation, relating to the application of perturbations (B.1) and the choice of prun...

In recent years, scholars have paid increasing attention to the joint entity and relation extraction. However, most difficult aspect of extraction is extracting overlapping triples. To address this problem, we propose a model based on Soft Pruning GlobalPointer, short for SGNet. first place, BERT pretraining used obtain text word vector representation with contextual information, then local non...

We design and implement a library for adding backtracking computations to any Haskell monad. Inspired by logic programming, our library provides, in addition to the operations required by the MonadPlus interface, constructs for fair disjunctions, fair conjunctions, conditionals, pruning, and an expressive top-level interface. Implementing these additional constructs is easy in models of backtra...

We face the job-shop problem with operators and total flow time minimization. This problem extends the classical job-shop problem by considering a limited number of operators that assist the processing of the operations. We propose a schedule generation scheme that extends the well-known G&T algorithm. This scheme is then exploited to design an any-time algorithm that combines best-first and gr...