A Conversion Procedure for NNC Polyhedra

11/27/2017
by   Anna Becchi, et al.
0

We present an alternative Double Description representation for the domain of NNC (not necessarily topologically closed) polyhedra, together with the corresponding Chernikova-like conversion procedure. The representation differs from the ones adopted in the currently available implementations of the Double Description method in that it uses no slack variable at all: this new approach provides a solution to a few technical issues caused by the encoding of an NNC polyhedron as a closed polyhedron in a higher dimension space. A preliminary experimental evaluation shows that the new conversion algorithm is able to achieve significant efficiency improvements with respect to state-of-the-art implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/25/2018

Alpha-conversion for lambda terms with explicit weakenings

Using explicit weakenings, we can define alpha-conversion by simple equa...
research
11/18/2020

Efficient Full Higher-Order Unification

We developed a procedure to enumerate complete sets of higher-order unif...
research
08/11/2015

Can JSP Code be Generated Using XML Tags?

Over the years, a variety of web services have started using server-side...
research
12/22/2022

Towards a Theory of Conversion Relations for Prefixed Units of Measure

Units of measure with prefixes and conversion rules are given a formal s...
research
05/18/2009

Do not Choose Representation just Change: An Experimental Study in States based EA

Our aim in this paper is to analyse the phenotypic effects (evolvability...
research
11/23/2022

Space-efficient RLZ-to-LZ77 conversion

Consider a text T [1..n] prefixed by a reference sequence R = T [1..ℓ]. ...
research
09/27/2021

Introducing the viewpoint in the resource description using machine learning

Search engines allow providing the user with data information according ...

Please sign up or login with your details

Forgot password? Click here to reset