×

Found 104 Documents (Results 1–100)

Secretary matching meets probing with commitment. (English) Zbl 07768358

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 13, 23 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Query minimization under stochastic uncertainty. (English) Zbl 1514.68055

Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 181-193 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems. (English) Zbl 1460.90137

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 133-149 (2020).
MSC:  90C25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Stochastic online metric matching. (English) Zbl 1523.68174

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 67, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal online contention resolution schemes via ex-ante prophet inequalities. (English) Zbl 1524.68451

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 57, 14 p. (2018).
MSC:  68W27 90C15 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online learning of a weighted selective naive Bayes classifier with non-convex optimization. (English) Zbl 1477.68268

Guillet, Fabrice (ed.) et al., Advances in knowledge discovery and management. Volume 6. Selected papers based on the presentations at the “Extraction et gestion des connaissances” conferences, EGC 2014 and EGC 2015, Rennes, France in January 2014 and Luxembourg in January 2015. Cham: Springer. Stud. Comput. Intell. 665, 3-17 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Stochastic \(k\)-server: how should Uber work? (English) Zbl 1442.68274

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 126, 14 p. (2017).
MSC:  68W27 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, and variational bounds. (English) Zbl 1403.68193

Hanneke, Steve (ed.) et al., International conference on algorithmic learning theory. Proceedings of the 28th conference (ALT 2017), Kyoto University, Kyoto, Japan, October 15–17, 2017. [s.l.]: Proceedings of Machine Learning Research PMLR. Proceedings of Machine Learning Research (PMLR) 76, 681-720 (2017).
MSC:  68T05 68W27 90C15
PDFBibTeX XMLCite
Full Text: arXiv Link

Stochastic online scheduling on unrelated machines. (English) Zbl 1416.90018

Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 19th international conference, IPCO 2017, Waterloo, ON, Canada, June 26–28, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10328, 228-240 (2017).
MSC:  90B36 90C27 68W27
PDFBibTeX XMLCite
Full Text: DOI Link

Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case. (English. Russian original) Zbl 1362.93165

Autom. Remote Control 78, No. 2, 224-234 (2017); translation from Avtom. Telemekh. 2017, No. 2, 36-49 (2017).
MSC:  93E20 90C15 93C55
PDFBibTeX XMLCite
Full Text: DOI

Online contention resolution schemes. (English) Zbl 1411.68203

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1014-1033 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

New algorithms, better bounds, and a novel model for online stochastic matching. (English) Zbl 1397.68228

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 24, 16 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

On the efficiency of a randomized mirror descent algorithm in online optimization problems. (English. Russian original) Zbl 1350.90027

Comput. Math. Math. Phys. 55, No. 4, 580-596 (2015); translation from Zh. Vychisl. Mat. Mat. Fiz. 55, No. 4, 582-598 (2015).
MSC:  90C15 91A05
PDFBibTeX XMLCite
Full Text: DOI

Randomized online algorithms for set cover leasing problems. (English) Zbl 1431.68158

Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8881, 25-34 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Catch them if you can: how to serve impatient users. (English) Zbl 1362.68296

Proceedings of the 4th conference on innovations in theoretical computer science, ITCS’13, Berkeley, CA, USA, January 9–12, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1859-4). 485-494 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Matroid prophet inequalities. (English) Zbl 1286.60037

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 123-136 (2012).
MSC:  60G40 62L15 60E15
PDFBibTeX XMLCite
Full Text: DOI arXiv

The semi-stochastic ski-rental problem. (English) Zbl 1246.68269

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 300-311, electronic only (2011).
MSC:  68W27 68Q87
PDFBibTeX XMLCite
Full Text: DOI

MPC for stochastic systems. (English) Zbl 1223.93119

Findeisen, Rolf (ed.) et al., Assessment and future directions of nonlinear model predictive control. Selected papers based on the presentations at the workshop (NMPC05), Freudenstadt-Lauterbad, Germany, August 26–30, 2005. Berlin: Springer (ISBN 978-3-540-72698-2/pbk). Lecture Notes in Control and Information Sciences 358, 255-268 (2007).
MSC:  93E20 93B51 93C41
PDFBibTeX XMLCite
Full Text: DOI

The EM algorithm, its randomized implementation and global optimization: some challenges and opportunities for operations research. (English) Zbl 1113.90032

Alt, Frank B. (ed.) et al., Perspectives in operations research. Papers in honor of Saul Gass’ 80th birthday. Papers partly based on the presentations at the symposium “Operations research in the 21st Century. New York, NY: Springer (ISBN 0-387-39933-X/hbk). Operations Research/Computer Science Interfaces Series 36, 367-392 (2006).
MSC:  90B15 90C26
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software