Auswahl der wissenschaftlichen Literatur zum Thema „Online algorithms with recourse“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Online algorithms with recourse" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Online algorithms with recourse"
Vasilopoulos, Vasileios, Georgios Pavlakos, Karl Schmeckpeper, Kostas Daniilidis und Daniel E. Koditschek. „Reactive navigation in partially familiar planar environments using semantic perceptual feedback“. International Journal of Robotics Research 41, Nr. 1 (22.10.2021): 85–126. http://dx.doi.org/10.1177/02783649211048931.
Der volle Inhalt der QuelleAbdelkader, Krifa, und Bouzrara Kais. „Robust H∞ gain neuro-adaptive observer design for nonlinear uncertain systems“. Transactions of the Institute of Measurement and Control 41, Nr. 8 (17.09.2018): 2293–309. http://dx.doi.org/10.1177/0142331218798685.
Der volle Inhalt der QuelleAngelopoulos, Spyros, Christoph Dürr und Shendan Jin. „Online maximum matching with recourse“. Journal of Combinatorial Optimization 40, Nr. 4 (03.09.2020): 974–1007. http://dx.doi.org/10.1007/s10878-020-00641-w.
Der volle Inhalt der QuelleAvitabile, T., C. Mathieu und L. Parkinson. „Online constrained optimization with recourse“. Information Processing Letters 113, Nr. 3 (Februar 2013): 81–86. http://dx.doi.org/10.1016/j.ipl.2012.09.011.
Der volle Inhalt der QuelleWang, Jinde. „Approximate nonlinear programming algorithms for solving stochastic programs with recourse“. Annals of Operations Research 31, Nr. 1 (Dezember 1991): 371–84. http://dx.doi.org/10.1007/bf02204858.
Der volle Inhalt der QuelleKulkarni, Ankur A., und Uday V. Shanbhag. „Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms“. Computational Optimization and Applications 51, Nr. 1 (12.02.2010): 77–123. http://dx.doi.org/10.1007/s10589-010-9316-8.
Der volle Inhalt der QuelleMegow, Nicole, Martin Skutella, José Verschae und Andreas Wiese. „The Power of Recourse for Online MST and TSP“. SIAM Journal on Computing 45, Nr. 3 (Januar 2016): 859–80. http://dx.doi.org/10.1137/130917703.
Der volle Inhalt der QuelleSmale, Steve, und Yuan Yao. „Online Learning Algorithms“. Foundations of Computational Mathematics 6, Nr. 2 (23.09.2005): 145–70. http://dx.doi.org/10.1007/s10208-004-0160-z.
Der volle Inhalt der QuelleBARBAKH, WESAM, und COLIN FYFE. „ONLINE CLUSTERING ALGORITHMS“. International Journal of Neural Systems 18, Nr. 03 (Juni 2008): 185–94. http://dx.doi.org/10.1142/s0129065708001518.
Der volle Inhalt der QuelleWang, Paul Y., Sainyam Galhotra, Romila Pradhan und Babak Salimi. „Demonstration of generating explanations for black-box algorithms using Lewis“. Proceedings of the VLDB Endowment 14, Nr. 12 (Juli 2021): 2787–90. http://dx.doi.org/10.14778/3476311.3476345.
Der volle Inhalt der QuelleDissertationen zum Thema "Online algorithms with recourse"
Lowe, Wing Wah. „An exploration of stochastic decomposition algorithms for stochastic linear programs with recourse“. Diss., The University of Arizona, 1994. http://hdl.handle.net/10150/186667.
Der volle Inhalt der QuelleLi, Le. „Online stochastic algorithms“. Thesis, Angers, 2018. http://www.theses.fr/2018ANGE0031.
Der volle Inhalt der QuelleThis thesis works mainly on three subjects. The first one is online clustering in which we introduce a new and adaptive stochastic algorithm to cluster online dataset. It relies on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that this algorithm has a regret bound of the order of and is asymptotically minimax under the constraint on the number of clusters. A RJMCMC-flavored implementation is also proposed. The second subject is related to the sequential learning of principal curves which seeks to represent a sequence of data by a continuous polygonal curve. To this aim, we introduce a procedure based on the MAP of Gibbs-posterior that can give polygonal lines whose number of segments can be chosen automatically. We also show that our procedure is supported by regret bounds with sublinear remainder terms. In addition, a greedy local search implementation that incorporates both sleeping experts and multi-armed bandit ingredients is presented. The third one concerns about the work which aims to fulfilling practical tasks within iAdvize, the company which supports this thesis. It includes sentiment analysis for textual messages by using methods in both text mining and statistics, and implementation of chatbot based on nature language processing and neural networks
Shi, Tian. „Novel Algorithms for Understanding Online Reviews“. Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/104998.
Der volle Inhalt der QuelleDoctor of Philosophy
Nowadays, online reviews are playing an important role in our daily lives. They are also critical to the success of many e-commerce and local businesses because they can help people build trust in brands and businesses, provide insights into products and services, and improve consumers' confidence. As a large number of reviews accumulate every day, a central research problem is to build an artificial intelligence system that can understand and interact with these reviews, and further use them to offer customers better support and services. In order to tackle challenges in these applications, we first have to get an in-depth understanding of online reviews. In this dissertation, we focus on the review understanding problem and develop machine learning and natural language processing tools to understand reviews and learn structured knowledge from unstructured reviews. We have addressed the review understanding problem in three directions, including understanding a collection of reviews, understanding a single review, and understanding a piece of a review segment. In the first direction, we proposed a short-text topic modeling method to extract topics from review corpora that consist of primary complaints of consumers. In the second direction, we focused on building sentiment analysis models to predict the opinions of consumers from their reviews. Our deep learning models can provide good prediction accuracy as well as a human-understandable explanation for the prediction. In the third direction, we develop an aspect detection method to automatically extract sentences that mention certain features consumers are interested in, from reviews, which can help customers efficiently navigate through reviews and help businesses identify the advantages and disadvantages of their products.
Trippen, Gerhard Wolfgang. „Online exploration and search in graphs /“. View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20TRIPPE.
Der volle Inhalt der QuelleLi, Rongbin, und 李榕滨. „New competitive algorithms for online job scheduling“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/197555.
Der volle Inhalt der Quellepublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
ALBUQUERQUE, LUIZ FERNANDO FERNANDES DE. „ONLINE ALGORITHMS ANALYSIS FOR SPONSORED LINKS SELECTION“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16088@1.
Der volle Inhalt der QuelleLinks patrocinados são aqueles que aparecem em destaque nos resultados de pesquisas em máquinas de busca na Internet e são grande fonte de receita para seus provedores. Para os anunciantes, que fazem ofertas por palavras-chave para aparecerem em destaque nas consultas dos usuários, são uma oportunidade de divulgação da marca, conquista e manutenção de clientes. Um dos desafios das máquinas de busca neste modelo de negócio é selecionar os anunciantes que serão exibidos a cada consulta de modo a maximizar sua receita em determinado período. Este é um problema tipicamente online, onde a cada consulta é tomada uma decisão sem o conhecimento prévio das próximas consultas. Após uma decisão ser tomada, esta não pode mais ser alterada. Nesta dissertação avaliamos experimentalmente algoritmos propostos na literatura para solução deste problema, comparando-os à solução ótima offline, em simulações com dados sintéticos. Supondo que o conjunto das consultas diárias obedeça a uma determinada distribuição, propomos dois algoritmos baseados em informações estocásticas que são avaliados nos mesmos cenários que os outros algoritmos.
Sponsored links are those that appear highlighted at Internet search engine results. They are responsible for a large amount of their providers’ revenue. To advertisers, that place bids for keywords in large auctions at Internet, these links are the opportunity of brand exposing and achieving more clients. To search engine companies, one of the main challenges in this business model is selecting which advertisers should be allocated to each new query to maximize their total revenue in the end of the day. This is a typical online problem, where for each query is taken a decision without previous knowledge of future queries. Once the decision is taken, it can not be modified anymore. In this work, using synthetically generated data, we do experimental evaluation of three algorithms proposed in the literature for this problem and compare their results with the optimal offline solution. Considering that daily query set obeys some well known distribution, we propose two algorithms based on stochastic information, those are evaluated in the same scenarios of the others.
Pasteris, S. U. „Efficient algorithms for online learning over graphs“. Thesis, University College London (University of London), 2016. http://discovery.ucl.ac.uk/1516210/.
Der volle Inhalt der QuelleBonifaci, Vincenzo. „Models and algorithms for online server routing“. Doctoral thesis, La Sapienza, 2007. http://hdl.handle.net/11573/917056.
Der volle Inhalt der QuelleHarrington, Edward Francis. „Aspects of online learning /“. View thesis entry in Australian Digital Theses Program, 2004. http://thesis.anu.edu.au/public/adt-ANU20060328.160810/index.html.
Der volle Inhalt der QuelleKamphans, Thomas. „Models and algorithms for online exploration and search“. [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980408121.
Der volle Inhalt der QuelleBücher zum Thema "Online algorithms with recourse"
Fiat, Amos, und Gerhard J. Woeginger, Hrsg. Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029561.
Der volle Inhalt der QuelleKaklamanis, Christos, und Asaf Levin, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2.
Der volle Inhalt der QuelleKoenemann, Jochen, und Britta Peis, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8.
Der volle Inhalt der QuelleChalermsook, Parinya, und Bundit Laekhanukit, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6.
Der volle Inhalt der QuelleBampis, Evripidis, und Ola Svensson, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6.
Der volle Inhalt der QuelleSanità, Laura, und Martin Skutella, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6.
Der volle Inhalt der QuelleErlebach, Thomas, und Giuseppe Persiano, Hrsg. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38016-7.
Der volle Inhalt der QuelleSolis-Oba, Roberto, und Giuseppe Persiano, Hrsg. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29116-6.
Der volle Inhalt der QuelleJansen, Klaus, und Monaldo Mastrolilli, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51741-4.
Der volle Inhalt der QuelleSolis-Oba, Roberto, und Rudolf Fleischer, Hrsg. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6.
Der volle Inhalt der QuelleBuchteile zum Thema "Online algorithms with recourse"
Liu, Alison Hsiang-Hsuan, und Jonathan Toole-Charignon. „The Power of Amortized Recourse for Online Graph Problems“. In Approximation and Online Algorithms, 134–53. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6_7.
Der volle Inhalt der QuelleGupta, Anupam, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar und Sahil Singla. „Online Discrepancy with Recourse for Vectors and Graphs“. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1356–83. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2022. http://dx.doi.org/10.1137/1.9781611977073.57.
Der volle Inhalt der QuelleFiat, Amos, und Gerhard J. Woeginger. „Competitive analysis of algorithms“. In Online Algorithms, 1–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029562.
Der volle Inhalt der QuelleAlbers, Susanne, und Jeffery Westbrook. „Self-organizing data structures“. In Online Algorithms, 13–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029563.
Der volle Inhalt der QuelleIrani, Sandy. „Competitive analysis of paging“. In Online Algorithms, 52–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029564.
Der volle Inhalt der QuelleChrobak, Marek, und Lawrence L. Larmore. „Metrical task systems, the server problem and the work function algorithm“. In Online Algorithms, 74–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029565.
Der volle Inhalt der QuelleBartal, Yair. „Distributed paging“. In Online Algorithms, 97–117. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029566.
Der volle Inhalt der QuelleAspnes, James. „Competitive analysis of distributed algorithms“. In Online Algorithms, 118–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029567.
Der volle Inhalt der QuelleCsirik, János, und Gerhard J. Woeginger. „On-line packing and covering problems“. In Online Algorithms, 147–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029568.
Der volle Inhalt der QuelleAzar, Yossi. „On-line load balancing“. In Online Algorithms, 178–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029569.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Online algorithms with recourse"
Fonseca, João, Andrew Bell, Carlo Abrate, Francesco Bonchi und Julia Stoyanovich. „Setting the Right Expectations: Algorithmic Recourse Over Time“. In EAAMO '23: Equity and Access in Algorithms, Mechanisms, and Optimization. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3617694.3623251.
Der volle Inhalt der QuelleKrishnaswamy, Ravishankar, Shi Li und Varun Suriyanarayana. „Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse“. In STOC '23: 55th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3564246.3585222.
Der volle Inhalt der QuelleAbé, M., und T. Igusa. „New Control Algorithms for Semi-Active Dynamic Vibration Absorbers“. In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0619.
Der volle Inhalt der QuelleMeng, De, Maryam Fazel und Mehran Mesbahi. „Online algorithms for network formation“. In 2016 IEEE 55th Conference on Decision and Control (CDC). IEEE, 2016. http://dx.doi.org/10.1109/cdc.2016.7798259.
Der volle Inhalt der QuelleBern, M., D. H. Greene, A. Raghunathan und M. Sudan. „Online algorithms for locating checkpoints“. In the twenty-second annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/100216.100264.
Der volle Inhalt der QuelleMeyerson, Adam. „Online algorithms for network design“. In the sixteenth annual ACM symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1007912.1007958.
Der volle Inhalt der QuelleKuh, Anthony, Muhammad Sharif Uddin und Phyllis Ng. „Online unsupervised kernel learning algorithms“. In 2017 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC). IEEE, 2017. http://dx.doi.org/10.1109/apsipa.2017.8282179.
Der volle Inhalt der QuelleRamanathan, Dinesh, und Rajesh Gupta. „System level online power management algorithms“. In the conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/343647.343867.
Der volle Inhalt der QuelleUddin, Muhammad Sharif, und Anthony Kuh. „Online Unsupervised Kernel Affine Projection Algorithms“. In 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC). IEEE, 2018. http://dx.doi.org/10.23919/apsipa.2018.8659616.
Der volle Inhalt der QuelleAndro-Vasko, James, Wolfgang Bein, Dara Nyknahad und Hiro Ito. „Evaluation of Online Power-Down Algorithms“. In 2015 12th International Conference on Information Technology - New Generations (ITNG). IEEE, 2015. http://dx.doi.org/10.1109/itng.2015.82.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Online algorithms with recourse"
Ur, Shmuel. Analysis of Online Algorithms for Organ Allocation. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1990. http://dx.doi.org/10.21236/ada249361.
Der volle Inhalt der QuelleLabrindis, Alexandros, und Nick Roussopoulos. A Performance Evaluation of Online Warehouse Update Algorithms. Fort Belvoir, VA: Defense Technical Information Center, Januar 1998. http://dx.doi.org/10.21236/ada441038.
Der volle Inhalt der QuelleMathew, Jijo K., Christopher M. Day, Howell Li und Darcy M. Bullock. Curating Automatic Vehicle Location Data to Compare the Performance of Outlier Filtering Methods. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317435.
Der volle Inhalt der QuelleDanylchuk, Hanna B., und Serhiy O. Semerikov. Advances in machine learning for the innovation economy: in the shadow of war. Криворізький державний педагогічний університет, August 2023. http://dx.doi.org/10.31812/123456789/7732.
Der volle Inhalt der QuelleArhin, Stephen, Babin Manandhar, Hamdiat Baba Adam und Adam Gatiba. Predicting Bus Travel Times in Washington, DC Using Artificial Neural Networks (ANNs). Mineta Transportation Institute, April 2021. http://dx.doi.org/10.31979/mti.2021.1943.
Der volle Inhalt der Quelle