Results 61 to 70 of about 71,380 (295)
Approximate polytope membership queries [PDF]
SIAM journal on computing (Print), 2011 We consider an approximate version of a fundamental geometric search problem, polytope membership queries. Given a convex polytope P in REd, presented as the intersection of halfspaces, the objective is to preprocess P so that, given a query point q, it ...
S. Arya, G. D. D. Fonseca, D. Mount
semanticscholar +1 more source
Exponential Lower Bounds for Polytopes in Combinatorial Optimization [PDF]
, 2015 We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric.
de Wolf, Ronald +4 more
core +4 more sources
International Journal of Mathematics and Mathematical Sciences, 1999 We show that for ⌊d/2⌋≤k≤d, the relative interior of every k-face of a d-simplex Δd can be intersected by a 2(d−k)-dimensional affine flat. Bezdek, Bisztriczky, and Connelly's results [2] show that the condition k≥⌊d/2⌋ above cannot be dropped and hence ...
Nagabhushana Prabhu
doaj +1 more source
Designing a polytope for use in a broad-spectrum dengue virus vaccine
Journal of Taibah University Medical Sciences, 2018 الملخص: أهداف البحث: البروتينات السطحية لفيروس حمى الضنك غالبا ما تستخدم لتطوير اللقاح لمنع العدوى الفيروسية. ومع ذلك، الاختلاف العالي للبروتينات السطحية لأربعة أنماط مصلية لفيروس حمى الضنك تعقّد تطوير اللقاح الذي يمكن أن تغطي جميع سلالات الفيروس.
Karimatul Himmah, M.Si +5 more
doaj +1 more source
Totally Splittable Polytopes [PDF]
Discrete & Computational Geometry, 2009 15 pages, 7 figures; v2: major revision: corrections of some minor errors and some ...
Herrmann, Sven, Joswig, Michael
openaire +2 more sources
Generalized permutohedra, h-vectors of cotransversal matroids and pure O-sequences (extended abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Stanley has conjectured that the h-vector of a matroid complex is a pure O-sequence. We will prove this for cotransversal matroids by using generalized permutohedra. We construct a bijection between lattice points inside a $r$-dimensional convex polytope
Suho Oh
doaj +1 more source
On Robust Global Error Bounds for a Class of Uncertain Piecewise Linear Inequality Systems
Axioms, 2022 This paper is concerned with the radius of robust global error bounds for an uncertain piecewise linear inequality system where the uncertain data are assumed to be in polytope uncertain sets.
Wen Tan, Xiaole Guo, Xiangkai Sun
doaj +1 more source
Polytope codes against adversaries in networks [PDF]
2010 IEEE International Symposium on Information Theory, 2010 Network coding is studied when an unknown subset of nodes in the network is controlled by an adversary. To solve this problem, a new class of codes called Polytope Codes is introduced.
O. Kosut, L. Tong, David Tse
semanticscholar +1 more source
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Asian Journal of Control, EarlyView.Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source
Antiprismless, or: Reducing Combinatorial Equivalence to Projective Equivalence in Realizability Problems for Polytopes [PDF]
, 2015 This article exhibits a 4-dimensional combinatorial polytope that has no antiprism, answering a question posed by Bernt Lindst\"om. As a consequence, any realization of this combinatorial polytope has a face that it cannot rest upon without toppling over.
Dobbins, Michael Gene
core