<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/themes/root/assets/xsl/rss.xsl"?>
<rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/">
  <channel>
    <title>Resultados para optimization (Algorithm OR Algorithms)</title>
    <description>Mostrando 1 - 50 Resultados de 7470</description>
    <generator>Laminas_Feed_Writer 2 (https://getlaminas.org)</generator>
    <link>https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;lookfor=optimization+%28Algorithm+OR+Algorithms%29&amp;type=AllFields&amp;lng=es</link>
    <opensearch:totalResults>7470</opensearch:totalResults>
    <opensearch:startIndex>0</opensearch:startIndex>
    <opensearch:itemsPerPage>50</opensearch:itemsPerPage>
    <opensearch:Query role="request" searchTerms="optimization%20%28Algorithm%20OR%20Algorithms%29" startIndex="0"/>
    <atom:link rel="first" type="application/rss+xml" title="Ir a la Primera Página" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=optimization+%28Algorithm+OR+Algorithms%29&amp;type=AllFields&amp;lng=es"/>
    <atom:link rel="next" type="application/rss+xml" title="Ir a la Siguiente Página" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=optimization+%28Algorithm+OR+Algorithms%29&amp;type=AllFields&amp;lng=es&amp;page=2"/>
    <atom:link rel="last" type="application/rss+xml" title="Ir a la Ultima Página" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=optimization+%28Algorithm+OR+Algorithms%29&amp;type=AllFields&amp;lng=es&amp;page=150"/>
    <atom:link rel="self" type="application/rss+xml" href="https://info.umar.mx/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=optimization+%28Algorithm+OR+Algorithms%29&amp;type=AllFields&amp;lng=es"/>
    <item>
      <title>Optimizing Supply Chain Management using Gravitational Search Algorithm and Multi Agent System</title>
      <pubDate>Sun, 01 Jan 2012 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1209_0308</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1209_0308</guid>
      <author>Ojha, Muneendra</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2012</dc:date>
      <dc:creator>Ojha, Muneendra</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Extended Fourier analysis of signals</title>
      <pubDate>Tue, 01 Jan 2013 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1303_2033</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1303_2033</guid>
      <author>Liepins, Vilnis</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2013</dc:date>
      <dc:creator>Liepins, Vilnis</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Socio-Spatial Group Queries for Impromptu Activity Planning</title>
      <pubDate>Thu, 01 Jan 2015 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1505_02681</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1505_02681</guid>
      <author>Shen, Chih-Ya</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Shen, Chih-Ya</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Deriving Priorities From Inconsistent PCM using the Network Algorithms</title>
      <pubDate>Thu, 01 Jan 2015 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1510_04315</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1510_04315</guid>
      <author>Anholcer, Marcin</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Anholcer, Marcin</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>On Sketching Quadratic Forms</title>
      <pubDate>Thu, 01 Jan 2015 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1511_06099</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1511_06099</guid>
      <author>Andoni, Alexandr</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Andoni, Alexandr</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1602_03104</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1602_03104</guid>
      <author>Dutta, Ayan</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Dutta, Ayan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1603_06757</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1603_06757</guid>
      <author>Hernando, Fernando</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Hernando, Fernando</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>An electronic-game framework for evaluating coevolutionary algorithms</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1604_00644</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1604_00644</guid>
      <author>de Araújo, Karine da Silva Miras</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>de Araújo, Karine da Silva Miras</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1604_08636</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1604_08636</guid>
      <author>Das, Priyam</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Das, Priyam</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Effective Blind Source Separation Based on the Adam Algorithm</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1605_07833</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1605_07833</guid>
      <author>Scarpiniti, Michele</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Scarpiniti, Michele</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Optimal Polynomial-Time Estimators: A Bayesian Notion of Approximation Algorithm</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1608_04112</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1608_04112</guid>
      <author>Kosoy, Vanessa</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Kosoy, Vanessa</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1610_00353</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1610_00353</guid>
      <author>Diaby, Moustapha</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Diaby, Moustapha</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Recognizing and Eliciting Weakly Single Crossing Profiles on Trees</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1611_04175</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1611_04175</guid>
      <author>Dey, Palash</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Dey, Palash</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Algorithms based on DQM with new sets of base functions for solving parabolic partial differential equations in $(2+1)$ dimension</title>
      <pubDate>Fri, 01 Jan 2016 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1611_08057</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1611_08057</guid>
      <author>Singh, Brajesh Kumar</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Singh, Brajesh Kumar</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Facing the phase problem in Coherent Diffractive Imaging via Memetic Algorithms</title>
      <pubDate>Sun, 01 Jan 2017 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1701_07685</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1701_07685</guid>
      <author>Colombo, Alessandro</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Colombo, Alessandro</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity</title>
      <pubDate>Sun, 01 Jan 2017 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1703_00544</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1703_00544</guid>
      <author>Knop, Dušan</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Knop, Dušan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>How algorithmic popularity bias hinders or promotes quality</title>
      <pubDate>Sun, 01 Jan 2017 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1707_00574</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1707_00574</guid>
      <author>Nematzadeh, Azadeh</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Nematzadeh, Azadeh</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices</title>
      <pubDate>Sun, 01 Jan 2017 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1710_00668</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1710_00668</guid>
      <author>Dvořák, Pavel</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Dvořák, Pavel</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Approximation Algorithms for D-optimal Design</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1802_08372</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1802_08372</guid>
      <author>Singh, Mohit</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Singh, Mohit</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Framework for Searching in Graphs in the Presence of Errors</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1804_02075</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1804_02075</guid>
      <author>Dereniowski, Dariusz</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Dereniowski, Dariusz</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Independent Distributions on a Multi-Branching AND-OR Tree of Height 2</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1804_06601</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1804_06601</guid>
      <author>Shigemizu, Mika</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Shigemizu, Mika</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1805_10708</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1805_10708</guid>
      <author>Jauregui, Benjamin</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Jauregui, Benjamin</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1806_03814</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1806_03814</guid>
      <author>Golin, Mordecai J.</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Golin, Mordecai J.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Polynomial time algorithm for optimal stopping with fixed accuracy</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1807_02227</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1807_02227</guid>
      <author>Goldberg, David A.</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Goldberg, David A.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1807_05443</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1807_05443</guid>
      <author>Friggstad, Zachary</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Friggstad, Zachary</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fuzzy Clustering to Identify Clusters at Different Levels of Fuzziness: An Evolutionary Multi-Objective Optimization Approach</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1808_03327</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1808_03327</guid>
      <author>Gupta, Avisek</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Gupta, Avisek</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Probabilistic Analysis of Edge Elimination for Euclidean TSP</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1809_10469</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1809_10469</guid>
      <author>Zhong, Xianghui</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Zhong, Xianghui</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Polyline Simplification has Cubic Complexity</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1810_00621</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1810_00621</guid>
      <author>Bringmann, Karl</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Bringmann, Karl</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Incentivizing Exploration with Selective Data Disclosure</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1811_06026</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1811_06026</guid>
      <author>Immorlica, Nicole</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Immorlica, Nicole</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Small Hazard-free Transducers</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1811_12369</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1811_12369</guid>
      <author>Bund, Johannes</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Bund, Johannes</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications</title>
      <pubDate>Mon, 01 Jan 2018 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1812_10269</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1812_10269</guid>
      <author>Agarwal, Pankaj K.</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Agarwal, Pankaj K.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Iterative Refinement for $\ell_p$-norm Regression</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1901_06764</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1901_06764</guid>
      <author>Adil, Deeksha</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Adil, Deeksha</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Transient Stability Assessment of Power Systems Based on Local Learning Machine and Bacterial Colony Chemotaxis Algorithm</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1901_08909</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1901_08909</guid>
      <author>Gu, Xueping</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Gu, Xueping</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Competitive Online Optimization under Inventory Constraints</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1901_09161</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1901_09161</guid>
      <author>Lin, Qiulin</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Lin, Qiulin</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1903_07410</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1903_07410</guid>
      <author>Baste, Julien</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Baste, Julien</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The Kikuchi Hierarchy and Tensor PCA</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1904_03858</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1904_03858</guid>
      <author>Wein, Alexander S.</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Wein, Alexander S.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Building a Nest by an Automaton</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1904_10850</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1904_10850</guid>
      <author>Czyzowicz, Jurek</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Czyzowicz, Jurek</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Tight Lower Bound for Comparison-Based Quantile Summaries</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_03838</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_03838</guid>
      <author>Cormode, Graham</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Cormode, Graham</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Streaming Algorithms for Bin Packing and Vector Scheduling</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_04897</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_04897</guid>
      <author>Cormode, Graham</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Cormode, Graham</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Online Computation with Untrusted Advice</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_05655</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_05655</guid>
      <author>Angelopoulos, Spyros</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Angelopoulos, Spyros</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_07145</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1905_07145</guid>
      <author>Zhai, Jianing</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Zhai, Jianing</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1906_00037</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1906_00037</guid>
      <author>Faybusovich, Leonid</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Faybusovich, Leonid</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Waiting is not easy but worth it: the online TSP on the line revisited</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1907_00317</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1907_00317</guid>
      <author>Chen, Pei-Chuan</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Chen, Pei-Chuan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1907_08735</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1907_08735</guid>
      <author>Ma, Will</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Ma, Will</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fenchel Duality Theory and A Primal-Dual Algorithm on Riemannian Manifolds</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1908_02022</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1908_02022</guid>
      <author>Bergmann, Ronny</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Bergmann, Ronny</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Greedy Algorithms for Hybrid Compressed Sensing</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1908_06359</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1908_06359</guid>
      <author>Tai, Ching-Lun</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Tai, Ching-Lun</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>String Indexing with Compressed Patterns</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1909_11930</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1909_11930</guid>
      <author>Bille, Philip</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Bille, Philip</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1909_12658</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1909_12658</guid>
      <author>Tani, Seiichiro</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Tani, Seiichiro</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>S-DIGing: A Stochastic Gradient Tracking Algorithm for Distributed Optimization</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1910_08704</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1910_08704</guid>
      <author>Li, Huaqing</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Li, Huaqing</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive</title>
      <pubDate>Tue, 01 Jan 2019 13:47:28 -0500</pubDate>
      <link>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1911_01951</link>
      <guid>https://info.umar.mx/Record/%0Aarxiv_https___arxiv_org_abs_1911_01951</guid>
      <author>Manoussakis, George</author>
      <dc:format>Preprint</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Manoussakis, George</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
  </channel>
</rss>
