Related papers: Generalizing Weighted Path Orders
When designing a motion planner for autonomous robots there are usually multiple objectives to be considered. However, a cost function that yields the desired trade-off between objectives is not easily obtainable. A common technique across…
Weighted finite-state machines are a fundamental building block of NLP systems. They have withstood the test of time -- from their early use in noisy channel models in the 1990s up to modern-day neurally parameterized conditional random…
In this paper, we study several definitions of generalized rank weights for arbitrary finite extensions of fields. We prove that all these definitions coincide, generalizing known results for extensions of finite fields.
A simple method of obtaining path-integral measures in higher-derivative gravities is presented. The measures are nothing but the generalized Lee-Yang terms.
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
Computing averages over a target probability density by statistical re-weighting of a set of samples with a different distribution is a strategy which is commonly adopted in fields as diverse as atomistic simulation and finance. Here we…
Gauge-invariant treatments of general-relativistic higher-order perturbations on generic background spacetime is proposed. We show the fact that the linear-order metric perturbation is decomposed into gauge-invariant and gauge-variant…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…
Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a sequence of waypoints, such as (hardware) middleboxes or (virtualized) network…
Directed topology is a refinement of standard topology, where spaces may have non-reversible paths. It has been put forward as a candidate approach to the analysis of concurrent processes. Recently, a wealth of different frameworks for,…
In a given 2D space, we can have points with different levels of importance. One would prefer viewing those points from a closer/farther position per their level of importance. A point in 2D from where the user can view two given points per…
We perform the stochastic quantization of scalar QED based on a generalization of the stochastic gauge fixing scheme and its geometric interpretation. It is shown that the stochastic quantization scheme exactly agrees with the usual path…
The ramification method in Implicit Computational Complexity has been associated with functional programming, but adapting it to generic imperative programming is highly desirable, given the wider algorithmic applicability of imperative…
We present a geometric interpretation of the integration-by-parts formula on an arbitrary vector bundle. As an application we give a new geometric formulation of higher-order variational calculus.
The standard and fractional projections are extended from binary two-mode networks to weighted two-mode networks. Some interesting properties of the extended projections are proved.
We introduce weighted succession rules and parametric production matrices - simple extensions of the standard ECO method succession rules and production matrices. The purpose is to enumerate combinatorial objects with respect to several…
Standard methods of using categorical variables as predictors either endow them with an ordinal structure or assume they have no structure at all. However, categorical variables often possess structure that is more complicated than a linear…
Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…