Lexicographic perturbation for multiparametric linear programming with applications to control [PDF]
, 2007 Accepted ...
Jones, CN, Kerrigan, EC, Maciejowski, JM
core +3 more sources
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers [PDF]
, 2006 We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$.
Balková, Lubomíra +2 more
core +2 more sources
On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles [PDF]
Computer Science Journal of Moldova, 2005 A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic ...
Sergey E. Bukhtoyarov +1 more
doaj
Linear tail-biting trellises: Characteristic generators and the BCJR-construction [PDF]
, 2010 We investigate the constructions of tail-biting trellises for linear block codes introduced by Koetter/Vardy (2003) and Nori/Shankar (2006). For a given code we will define the sets of characteristic generators more generally than by Koetter/Vardy and we
Gluesing-Luerssen, Heide +1 more
core +1 more source
Reverse-Safe Data Structures for Text Indexing [PDF]
, 2020 We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed).
Gabriele Fici +4 more
core +5 more sources
Journal of Numerical Analysis and Approximation Theory, 2006 multicriteria linear combinatorial problem is considered, principle of optimality of which is defined by a partitioning of partial criteria onto groups with Slater preference relation within each group and the lexicographic preference relation ...
Vladimir A. Emelichev +1 more
doaj +2 more sources
Answer Set Planning Under Action Costs
, 2011 Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs.
Eiter, T. +4 more
core +1 more source
The baker's map with a convex hole
, 2018 We consider the baker's map $B$ on the unit square $X$ and an open convex set $H\subset X$ which we regard as a hole. The survivor set $\mathcal J(H)$ is defined as the set of all points in $X$ whose $B$-trajectories are disjoint from $H$.
Clark, Lyndsey +2 more
core +1 more source
Efficient Compressive Sampling of Spatially Sparse Fields in Wireless Sensor Networks [PDF]
, 2013 Wireless sensor networks (WSN), i.e. networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields.
Colonnese, Stefania +4 more
core +2 more sources
PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning
, 2020 Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, collision, visibility, and motion constraints involving robot configurations ...
Garrett, Caelan Reed +2 more
core +2 more sources