Ergodic Control and Polyhedral Approaches to PageRank Optimization [PDF]
We study a general class of PageRank optimization problems which consist in finding an optimal outlink strategy for a web site subject to design constraints. We consider both a continuous problem, in which one can choose the intensity of a link, and a discrete one, in which in each page, there are obligatory links, facultative links and forbidden links.
Fercoq, Olivier +3 more
openaire +3 more sources
Editing Watertight Manifold Polyhedra using Face Shifts with Automatic Topological Updates and Edge Flips [PDF]
In the context of urban 3D mapping, the 3D modelling step is a crucial operation, which can be very error prone, particularly when high fidelity and accuracy are required. While automatic reconstruction tools are way faster and less expensive than manual
F. Geniet, M. Brédif, B. Vallet
doaj +1 more source
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification [PDF]
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer ...
Bishoksan Kafle, John P. Gallagher
doaj +1 more source
A polyhedral approach to single-machine scheduling problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akker J.M. van den +2 more
openaire +5 more sources
Motion generation of a planar 3R serial chain based on conformal geometric algebra with applications to planar linkages [PDF]
A planar three-revolute (3R) serial chain is an important part of many mechanisms. The classical approach in motion generation of a planar 3R serial chain is to construct closed-loop equations based on complex numbers, which yields a large-scale ...
L. Wang +7 more
doaj +1 more source
A polyhedral approach for the equitable coloring problem
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting ...
Isabel Méndez-Díaz +2 more
openaire +3 more sources
A polyhedral approach to the stability of a family of coalitions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aguilera, Néstor Edgardo +1 more
openaire +2 more sources
Background RNA secondary structure prediction is a compute intensive task that lies at the core of several search algorithms in bioinformatics. Fortunately, the RNA folding approaches, such as the Nussinov base pair maximization, involve mathematical ...
Marek Palkowski, Wlodzimierz Bielecki
doaj +1 more source
A polyhedral approach to the generalized minimum labeling spanning tree problem
The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj +1 more source
LMGC90: a Contact Dynamics open source code for the simulation of granular asteroid with realistic regolith shapes. Application to the accretion process [PDF]
Granular asteroids are naturally occurring gravitational aggregates (rubble piles) bound together by gravitational forces. For this reason, it is reasonable to use the theoretical concepts and numerical tools developed for granular media to study them ...
Sánchez Paul +3 more
doaj +1 more source

