<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="https://puma.ub.uni-stuttgart.de/tag/computing%20Computing%20parallel%20classical"><title>PUMA publications for /tag/computing%20Computing%20parallel%20classical</title><link>https://puma.ub.uni-stuttgart.de/tag/computing%20Computing%20parallel%20classical</link><description>PUMA RSS feed for /tag/computing%20Computing%20parallel%20classical</description><dc:date>2026-04-24T09:20:49+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/bibtex/24c7f4e3b1b49cc12d34bc5407caf12da/annettegugel"/></rdf:Seq></items></channel><item rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/24c7f4e3b1b49cc12d34bc5407caf12da/annettegugel"><title>PQ Prediction by Way of Parallel Computing - Benchmark and Sensitivity Analysis for classical ML Approaches</title><link>https://puma.ub.uni-stuttgart.de/bibtex/24c7f4e3b1b49cc12d34bc5407caf12da/annettegugel</link><dc:creator>annettegugel</dc:creator><dc:date>2020-10-07T14:13:11+02:00</dc:date><dc:subject>Analysis Approaches Benchmark Computing ML PQ Parallel Prediction Sensitivity classical </dc:subject><content:encoded>&lt;span data-person-type=&#034;author&#034; class=&#034;authorEditorList &#034;&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;Adrian Eisenmann&#034; itemprop=&#034;url&#034; href=&#034;/person/1d9d910e2c458d7321a48471f8f563b22/author/0&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;A. Eisenmann&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;, &lt;/span&gt;&lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;Tim Streubel&#034; itemprop=&#034;url&#034; href=&#034;/person/1d9d910e2c458d7321a48471f8f563b22/author/1&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;T. Streubel&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;, &lt;/span&gt; and &lt;span&gt;&lt;span itemtype=&#034;http://schema.org/Person&#034; itemscope=&#034;itemscope&#034; itemprop=&#034;author&#034;&gt;&lt;a title=&#034;Krzysztof Rudion&#034; itemprop=&#034;url&#034; href=&#034;/person/1d9d910e2c458d7321a48471f8f563b22/author/2&#034;&gt;&lt;span itemprop=&#034;name&#034;&gt;K. Rudion&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;. &lt;/span&gt;&lt;span class=&#034;additional-entrytype-information&#034;&gt;(&lt;em&gt;&lt;span&gt;2019&lt;meta content=&#034;2019&#034; itemprop=&#034;datePublished&#034;/&gt;&lt;/span&gt;&lt;/em&gt;)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Analysis"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Approaches"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Benchmark"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Computing"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/ML"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/PQ"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Parallel"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Prediction"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/Sensitivity"/><rdf:li rdf:resource="https://puma.ub.uni-stuttgart.de/tag/classical"/></rdf:Bag></taxo:topics></item></rdf:RDF>