1,219 research outputs found

    Better Orders for Saturated Cost Partitioning in Optimal Classical Planning

    Get PDF

    Twisted index theory on orbifold symmetric products and the fractional quantum Hall effect

    Get PDF
    We extend the noncommutative geometry model of the fractional quantum Hall effect, previously developed by Mathai and the first author, to orbifold symmetric products. It retains the same properties of quantization of the Hall conductance at integer multiples of the fractional Satake orbifold Euler characteristics. We show that it also allows for interesting composite fermions and anyon representations, and possibly for Laughlin type wave functions

    Magna Carta in the Late Middle Ages: Over-Mighty Subjects, Under-Mighty Kings, and a Turn Away from Trial by Jury

    Get PDF
    What did English lawyers know about Magna Carta in the fourteenth and fifteenth centuries? How did they talk about it? Did they regard the king as above the law or subordinate to it? What did they make of the guarantees that we now think were most important in Magna Carta, the guarantee of judgment of peers or the law of the land, and of speedy justice? The evidence of the Year Books is that Magna Carta was treated as a minor statute, that the king was or ought to be above the law in many respects, and that trial by jury was a risk to be avoided, if possible, because juries could be so easily intimidated

    On a Cardinality Constrained Multicriteria Knapsack Problem

    Get PDF
    We consider a variant of a knapsack problem with a fixed cardinality constraint. There are three objective functions to be optimized: one real-valued and two integer-valued objectives. We show that this problem can be solved efficiently by a local search. The algorithm utilizes connectedness of a subset of feasible solutions and has optimal run-time

    Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning

    Get PDF
    In classical planning, cost partitioning is a method for admissibly combining a set of heuristic estimators by distributing operator costs among the heuristics. An optimal cost partitioning is often prohibitively expensive to compute. Saturated cost partitioning is an alternative that is much faster to compute and has been shown to offer high-quality heuristic guidance on Cartesian abstractions. However, its greedy nature makes it highly susceptible to the order in which the heuristics are considered. We show that searching in the space of orders leads to significantly better heuristic estimates than with previously considered orders. Moreover, using multiple orders leads to a heuristic that is significantly better informed than any single-order heuristic. In experiments with Cartesian abstractions, the resulting heuristic approximates the optimal cost partitioning very closely

    A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning

    Get PDF
    Cost partitioning is a general and principled approach for constructing additive admissible heuristics for state-space search. Cost partitioning approaches for optimal classical planning include optimal cost partitioning, uniform cost partitioning, zero-one cost partitioning, saturated cost partitioning, post-hoc optimization and the canonical heuristic for pattern databases. We compare these algorithms theoretically, showing that saturated cost partitioning dominates greedy zero-one cost partitioning. As a side effect of our analysis, we obtain a new cost partitioning algorithm dominating uniform cost partitioning. We also evaluate these algorithms experimentally on pattern databases, Cartesian abstractions and landmark heuristics, showing that saturated cost partitioning is usually the method of choice on the IPC benchmark suite

    Scalable exploration of relevance prospects to support decision making

    Get PDF
    Recent efforts in recommender systems research focus increasingly on human factors that affect acceptance of recommendations, such as user satisfaction, trust, transparency, and user control. In this paper, we present a scalable visualisation to interleave the output of several recommender engines with human-generated data, such as user bookmarks and tags. Such a visualisation enables users to explore which recommendations have been bookmarked by like-minded members of the community or marked with a specific relevant tag. Results of a preliminary user study (N =20) indicate that effectiveness and probability of item selection increase when users can explore relations between multiple recommendations and human feedback. In addition, perceived effectiveness and actual effectiveness of the recommendations as well as user trust into the recommendations are higher than a traditional list representation of recommendations

    State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning

    Get PDF
    Abstraction heuristics are a popular method to guide optimal search algorithms in classical planning. Cost partitionings allow to sum heuristic estimates admissibly by distributing action costs among the heuristics. We introduce state-dependent cost partitionings which take context information of actions into account, and show that an optimal state-dependent cost partitioning dominates its state-independent counterpart. We demonstrate the potential of our idea with a state-dependent variant of the recently proposed saturated cost partitioning, and show that it has the potential to improve not only over its state-independent counterpart, but even over the optimal state-independent cost partitioning. Our empirical results give evidence that ignoring the context of actions in the computation of a cost partitioning leads to a significant loss of information

    Existence of a stable polarized vacuum in the Bogoliubov-Dirac-Fock approximation

    Full text link
    According to Dirac's ideas, the vacuum consists of infinitely many virtual electrons which completely fill up the negative part of the spectrum of the free Dirac operator D0D^0. In the presence of an external field, these virtual particles react and the vacuum becomes polarized. In this paper, following Chaix and Iracane ({\it J. Phys. B}, 22, 3791--3814, 1989), we consider the Bogoliubov-Dirac-Fock model, which is derived from no-photon QED. The corresponding BDF-energy takes the polarization of the vacuum into account and is bounded from below. A BDF-stable vacuum is defined to be a minimizer of this energy. If it exists, such a minimizer is solution of a self-consistent equation. We show the existence of a unique minimizer of the BDF-energy in the presence of an external electrostatic field, by means of a fixed-point approach. This minimizer is interpreted as the polarized vacuum.Comment: final version, to appear in Commun. Math. Phy
    corecore