×

Found 965 Documents (Results 101–200)

Non-polynomial worst-case analysis of recursive programs. (English) Zbl 1494.68053

Majumdar, Rupak (ed.) et al., Computer aided verification. 29th international conference, CAV 2017, Heidelberg, Germany, July 24–28, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10427, 41-63 (2017).
MSC:  68N30 68Q25 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Ascertaining uncertainty for efficient exact cache analysis. (English) Zbl 1494.68063

Majumdar, Rupak (ed.) et al., Computer aided verification. 29th international conference, CAV 2017, Heidelberg, Germany, July 24–28, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10427, 22-40 (2017).
MSC:  68N30 68Q60
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of an adaptive subdivision method for approximating real curves. (English) Zbl 1457.65013

Burr, Michael (ed.), Proceedings of the 42nd international symposium on symbolic and algebraic computation, ISSAC 2017, Kaiserslautern, Germany, July 25–28, 2017. New York, NY: Association for Computing Machinery (ACM). 61-68 (2017).
MSC:  65D18 65Y20
PDFBibTeX XMLCite
Full Text: DOI

Threshold constraints with guarantees for parity objectives in Markov decision processes. (English) Zbl 1442.90199

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 121, 15 p. (2017).
MSC:  90C40 68Q25 91A43
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating coupled-task scheduling problems with equal exact delays. (English) Zbl 1385.90006

Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 259-271 (2016).
MSC:  90B35
PDFBibTeX XMLCite
Full Text: DOI

Constant-factor approximations for cycle cover problems. (English) Zbl 1385.90001

Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 93-104 (2016).
MSC:  90B06
PDFBibTeX XMLCite
Full Text: DOI

On the smoothed complexity of convex hulls. (English) Zbl 1378.68170

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 224-238 (2015).
MSC:  68U05 52B55
PDFBibTeX XMLCite
Full Text: DOI

Improved approximations for the max \(k\)-colored clustering problem. (English) Zbl 1457.68304

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 12th international workshop, WAOA 2014, Wrocław, Poland, September 11–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8952, 1-10 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Machine scheduling with a maintenance interval and job delivery coordination. (English) Zbl 1356.90056

Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-19646-6/pbk; 978-3-319-19647-3/ebook). Lecture Notes in Computer Science 9130, 104-114 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software