Littérature scientifique sur le sujet « Online algorithm with advice »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Online algorithm with advice ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Online algorithm with advice"
Lee, Russell, Jessica Maghakian, Mohammad Hajiesmaili, Jian Li, Ramesh Sitaraman et Zhenhua Liu. « Online peak-aware energy scheduling with untrusted advice ». ACM SIGEnergy Energy Informatics Review 1, no 1 (novembre 2021) : 59–77. http://dx.doi.org/10.1145/3508467.3508473.
Texte intégralBianchi, Maria Paola, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm et Beatrice Palano. « Online Minimum Spanning Tree with Advice ». International Journal of Foundations of Computer Science 29, no 04 (juin 2018) : 505–27. http://dx.doi.org/10.1142/s0129054118410034.
Texte intégralBoyar, Joan, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen et Jesper W. Mikkelsen. « Online Algorithms with Advice ». ACM Computing Surveys 50, no 2 (19 juin 2017) : 1–34. http://dx.doi.org/10.1145/3056461.
Texte intégralBarrière, Lali, Xavier Muñoz, Janosch Fuchs et Walter Unger. « Online Matching in Regular Bipartite Graphs ». Parallel Processing Letters 28, no 02 (juin 2018) : 1850008. http://dx.doi.org/10.1142/s0129626418500081.
Texte intégralChen, Li-Hsuan, Ling-Ju Hung, Henri Lotze et Peter Rossmanith. « Online Node- and Edge-Deletion Problems with Advice ». Algorithmica 83, no 9 (30 juin 2021) : 2719–53. http://dx.doi.org/10.1007/s00453-021-00840-9.
Texte intégralLykouris, Thodoris, et Sergei Vassilvitskii. « Competitive Caching with Machine Learned Advice ». Journal of the ACM 68, no 4 (7 juillet 2021) : 1–25. http://dx.doi.org/10.1145/3447579.
Texte intégralBoyar, Joan, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen et Jesper W. Mikkelsen. « Online Algorithms with Advice : A Survey ». ACM SIGACT News 47, no 3 (31 août 2016) : 93–129. http://dx.doi.org/10.1145/2993749.2993766.
Texte intégralBöckenhauer, Hans-Joachim, Dennis Komm, Rastislav Královič, Richard Královič et Tobias Mömke. « Online algorithms with advice : The tape model ». Information and Computation 254 (juin 2017) : 59–83. http://dx.doi.org/10.1016/j.ic.2017.03.001.
Texte intégralAumayr, Erik, Jeffrey Chan et Conor Hayes. « Reconstruction of Threaded Conversations in Online Discussion Forums ». Proceedings of the International AAAI Conference on Web and Social Media 5, no 1 (3 août 2021) : 26–33. http://dx.doi.org/10.1609/icwsm.v5i1.14122.
Texte intégralZhao, Xiaofan, et Hong Shen. « Online algorithms for 2D bin packing with advice ». Neurocomputing 189 (mai 2016) : 25–32. http://dx.doi.org/10.1016/j.neucom.2015.11.035.
Texte intégralThèses sur le sujet "Online algorithm with advice"
Renault, Marc Paul. « Lower and upper bounds for online algorithms with advice ». Paris 7, 2014. http://www.theses.fr/2014PA077196.
Texte intégralOnline algorithms operate in a setting where the input is revealed piece by piece; the pieces are called requests. After receiving each request, online algorithms must take an action before the next request is revealed, i. E. Online algorithms must make irrevocable decisions based on the input revealed so far without any knowledge of the future input. The goal is to optimize some cost function over the input. Competitive analysis is the standard method used to analyse the quality of online algorithms. The competitive ratio is the worst case ratio, over all valid finite request sequences, of the online algorithm's performance against an optimal offline algorithm for the same request sequence. The competitive ratio compares the performance of an algorithm with no knowledge about the future against an algorithm with full knowledge about the future. Since the complete absence of future knowledge is often not a reasonable assumption, models, termed online algorithms with advice, which give the online algorithms access to a quantified amount of future knowledge, have been proposed. The interest in this model is in examining how the competitive ratio changes as a function of the amount of advice. In this thesis, we present upper and lower bounds in the advice model for classical online problems such as the k-server problem, the bin packing problem, the dual bin packing (multiple knapsack) problem, scheduling problem on m identical machines, the reordering buffer management problem and the list update problem
Jin, Shendan. « Online computation beyond standard models ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS152.
Texte intégralIn the standard setting of online computation, the input is not entirely available from the beginning, but is revealed incrementally, piece by piece, as a sequence of requests. Whenever a request arrives, the online algorithm has to make immediately irrevocable decisions to serve the request, without knowledge on the future requests. Usually, the standard framework to evaluate the performance of online algorithms is competitive analysis, which compares the worst-case performance of an online algorithm to an offline optimal solution. In this thesis, we will study some new ways of looking at online problems. First, we study the online computation in the recourse model, in which the irrevocability on online decisions is relaxed. In other words, the online algorithm is allowed to go back and change previously made decisions. More precisely, we show how to identify the trade-off between the number of re-optimization and the performance of online algorithms for the online maximum matching problem. Moreover, we study measures other than competitive analysis for evaluating the performance of online algorithms. We observe that sometimes, competitive analysis cannot distinguish the performance of different algorithms due to the worst-case nature of the competitive ratio. We demonstrate that a similar situation arises in the linear search problem. More precisely, we revisit the linear search problem and introduce a measure, which can be applied as a refinement of the competitive ratio. Last, we study the online computation in the advice model, in which the algorithm receives as input not only a sequence of requests, but also some advice on the request sequence. Specifically, we study a recent model with untrusted advice, in which the advice can be either trusted or untrusted. Assume that in the latter case, the advice can be generated from a malicious source. We show how to identify a Pareto optimal strategy for the online bidding problem in the untrusted advice model
Cayuela, Rafols Marc. « Algorithmic Study on Prediction with Expert Advice : Study of 3 novel paradigms with Grouped Experts ». Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254344.
Texte intégralHuvudarbetet för den här avhandlingen har varit en grundlig studie av den nya Prediction with Partially Monitored Grouped Expert Advice and Side Information paradigmet. Detta är nyligen föreslagit i denna avhandling, och det utökar det brett studerade Prediction with Expert Advice paradigmet. Förlängningen baseras på två antaganden och en begränsning som ändrar det ursprungliga problemet. Det första antagandet, Grouped, förutsätter att experterna är inbyggda i grupper. Det andra antagandet, Side Information, introducerar ytterligare information som kan användas för att i tid relatera förutsägelser med grupper. Slutligen innebär begränsningen, Partially Monitored, att gruppens förutsägelser endast är kända för en grupp i taget. Studien av detta paradigm innefattar utformningen av en komplett förutsägelsesalgoritm, beviset på en teoretisk bindning till det sämre fallet kumulativa ånger för en sådan algoritm och en experimentell utvärdering av algoritmen (bevisar förekomsten av fall där detta paradigm överträffar Prediction with Expert Advice). Eftersom algoritmens utveckling är konstruktiv tillåter den dessutom att enkelt bygga två ytterligare prediksionsalgoritmer för Prediction with Grouped Expert Advice och Prediction with Grouped Expert Advice and Side Information paradigmer. Därför presenterar denna avhandling tre nya prediktionsalgoritmer med motsvarande ångergränser och en jämförande experimentell utvärdering inklusive det ursprungliga Prediction with Expert Advice paradigmet.
Henke, Hans-Christian. « Online Advice : Konzeption eines ergebnisbasierten Simulationsansatzes / ». [S.l. : s.n.], 2003. http://www.gbv.de/dms/zbw/362397171.pdf.
Texte intégralFurkin, Jennifer D. « MOM TO MOM : ONLINE BREASTFEEDING ADVICE ». UKnowledge, 2018. https://uknowledge.uky.edu/comm_etds/64.
Texte intégralPorter, Noriko. « Japanese and U. S. mother's concerns and experts' advice content analysis of mothers' questions on online message boards and experts' advice in parenting magazines / ». Diss., Columbia, Mo. : University of Missouri-Columbia, 2008. http://hdl.handle.net/10355/5517.
Texte intégralThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on June 15, 2009) Vita. Includes bibliographical references.
Fowler-Dawson, Amy E. « Expand your online reach with these 10 social media tips from the pros : An analysis of online social networking advice ». OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/2047.
Texte intégralBarbaro, Billy. « Tuning Hyperparameters for Online Learning ». Case Western Reserve University School of Graduate Studies / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=case1522419008006144.
Texte intégralMurphy, Nicholas John. « An online learning algorithm for technical trading ». Master's thesis, Faculty of Science, 2019. http://hdl.handle.net/11427/31048.
Texte intégralOrlansky, Emily. « Beauty is in the mouth of the beholder advice networks at Haverford College / ». Diss., Connect to the thesis, 2009. http://hdl.handle.net/10066/3707.
Texte intégralLivres sur le sujet "Online algorithm with advice"
Kienholz, Michelle. Online guide to medical research : Valuable internet resources for medical research, practice & advice. San Jose, CA : Ventana, 1999.
Trouver le texte intégralMoore, Alexis. Cyber self-defense : Expert advice to avoid online predators, identity theft, and cyberbullying. Guilford, Connecticut : Lyons Press, 2014.
Trouver le texte intégralThe weblog handbook : Practical advice on creating and maintaining your blog. Cambridge, MA : Perseus Pub., 2002.
Trouver le texte intégralJohn, Yate Martin, dir. Knock 'em dead résumés : Smart advice to make your online and paper résumés more productive. 8e éd. Avon, Mass : Adams Media, 2008.
Trouver le texte intégralPauline, David, dir. Your personal net doctor : Your guide to health and medical advice on the Internet and online services. New York : Wolff New Media, 1996.
Trouver le texte intégralTwitter marketing tips : 3 surprisingly powerful tips to make Twitter pay off with no costs upfront and much more : 101 world class expert facts, hints, tips and advice on Twitter. Brisbane, Australia] : [Emereo], 2009.
Trouver le texte intégralPrice, Joan. The insider's guide to internet health searches : Real-life success stories and expert advice for finding online health information you can trust. Emmaus, PA : Rodale Press, 2002.
Trouver le texte intégralGiuseppe, Persiano, et SpringerLink (Online service), dir. Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
Trouver le texte intégralErlebach, Thomas. Approximation and Online Algorithms : 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013.
Trouver le texte intégralBolles, Mark Emery. Job-hunting online : A guide to job listings, message boards, research sites, the UnderWeb, counseling, networking, self-assessment tools, niche sites. 5e éd. Berkeley : Ten Speed Press, 2008.
Trouver le texte intégralChapitres de livres sur le sujet "Online algorithm with advice"
Borodin, Allan, Joan Boyar, Kim S. Larsen et Denis Pankratov. « Advice Complexity of Priority Algorithms ». Dans Approximation and Online Algorithms, 69–86. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4_5.
Texte intégralAdamaszek, Anna, Marc P. Renault, Adi Rosén et Rob van Stee. « Reordering Buffer Management with Advice ». Dans Approximation and Online Algorithms, 132–43. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7_12.
Texte intégralChrist, Marie G., Lene M. Favrholdt et Kim S. Larsen. « Online Multi-Coloring with Advice ». Dans Approximation and Online Algorithms, 83–94. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6_8.
Texte intégralBöckenhauer, Hans-Joachim, Janosch Fuchs et Walter Unger. « Exploring Sparse Graphs with Advice (Extended Abstract) ». Dans Approximation and Online Algorithms, 102–17. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4_7.
Texte intégralBöckenhauer, Hans-Joachim, Dennis Komm et Raphael Wegner. « Call Admission Problems on Grids with Advice (Extended Abstract) ». Dans Approximation and Online Algorithms, 118–33. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4_8.
Texte intégralDobrev, Stefan, Rastislav Královič et Richard Královič. « Independent Set with Advice : The Impact of Graph Knowledge ». Dans Approximation and Online Algorithms, 2–15. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38016-7_2.
Texte intégralBöckenhauer, Hans-Joachim, Dennis Komm, Rastislav Královič, Richard Královič et Tobias Mömke. « On the Advice Complexity of Online Problems ». Dans Algorithms and Computation, 331–40. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10631-6_35.
Texte intégralRenault, Marc P., et Adi Rosén. « On Online Algorithms with Advice for the k-Server Problem ». Dans Approximation and Online Algorithms, 198–210. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29116-6_17.
Texte intégralRohatgi, Dhruv. « Near-Optimal Bounds for Online Caching with Machine Learned Advice ». Dans Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1834–45. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.112.
Texte intégralAdamy, Udo, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann et Emo Welzl. « Off-line Admission Control for Advance Reservations in Star Networks ». Dans Approximation and Online Algorithms, 211–24. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31833-0_18.
Texte intégralActes de conférences sur le sujet "Online algorithm with advice"
Zhao, Xiaofan, Xin Li et Hong Shen. « Improved Online Algorithms for One-Dimensional BinPacking with Advice ». Dans 2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT). IEEE, 2017. http://dx.doi.org/10.1109/pdcat.2017.00042.
Texte intégralCreveling, Jessica, et Cedric Hagen. « COMBINING A δ13CCARB CORRELATION ALGORITHM AND A REFINED RADIOMETRIC CHRONOLOGY TO ADVANCE PRECAMBRIAN (EDIACARAN) BASIN ANALYSIS ». Dans GSA 2020 Connects Online. Geological Society of America, 2020. http://dx.doi.org/10.1130/abs/2020am-355524.
Texte intégralVaidya, Nupur D., Yogesh A. Suryawanshi et Manish Chavan. « Design for enhancing the performance of Advance Encryption Standard algorithm VHDL ». Dans 2016 Online International Conference on Green Engineering and Technologies (IC-GET). IEEE, 2016. http://dx.doi.org/10.1109/get.2016.7916849.
Texte intégralGanapathi Subramanian, Sriram, Matthew E. Taylor, Kate Larson et Mark Crowley. « Multi-Agent Advisor Q-Learning (Extended Abstract) ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/776.
Texte intégralHikima, Yuya, Yasunori Akagi, Naoki Marumo et Hideaki Kim. « Online Matching with Controllable Rewards and Arrival Probabilities ». Dans Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California : International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/254.
Texte intégralNirala, C. K., et P. Saha. « Development of an algorithm for online pulse discrimination in micro-EDM using current and voltage sensors and their comparison ». Dans 2015 IEEE International Advance Computing Conference (IACC). IEEE, 2015. http://dx.doi.org/10.1109/iadcc.2015.7154758.
Texte intégralSivagnanam, Amutheezan, Salah Uddin Kadir, Ayan Mukhopadhyay, Philip Pugliese, Abhishek Dubey, Samitha Samaranayake et Aron Laszka. « Offline Vehicle Routing Problem with Online Bookings : A Novel Problem Formulation with Applications to Paratransit ». Dans Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California : International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/546.
Texte intégralCai, Xia. « Vector Autoregressive Weighting Reversion Strategy for Online Portfolio Selection ». Dans Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California : International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/616.
Texte intégralZhu, Yada, Jianbo Li, Jingrui He, Brian L. Quanz et Ajay A. Deshpande. « A Local Algorithm for Product Return Prediction in E-Commerce ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/517.
Texte intégralZenun Franco, Rodrigo. « Online Recommender System for Personalized Nutrition Advice ». Dans RecSys '17 : Eleventh ACM Conference on Recommender Systems. New York, NY, USA : ACM, 2017. http://dx.doi.org/10.1145/3109859.3109862.
Texte intégralRapports d'organisations sur le sujet "Online algorithm with advice"
Balman, Mehmet, et Tevfik Kosar. An Online Scheduling Algorithm with Advance Reservation for Large-Scale Data Transfers. Office of Scientific and Technical Information (OSTI), mai 2010. http://dx.doi.org/10.2172/1050437.
Texte intégralSantesson, S., et P. Hallam-Baker. Online Certificate Status Protocol Algorithm Agility. RFC Editor, juin 2011. http://dx.doi.org/10.17487/rfc6277.
Texte intégralStreeter, Matthew, et Daniel Golovin. An Online Algorithm for Maximizing Submodular Functions. Fort Belvoir, VA : Defense Technical Information Center, décembre 2007. http://dx.doi.org/10.21236/ada476748.
Texte intégralMeeker, Jessica. Mutual Learning for Policy Impact : Insights from CORE. Shaping Policy and Practice with Intersectional Gender Responsive Evidence (in the Context of Covid-19). Institute of Development Studies (IDS), novembre 2021. http://dx.doi.org/10.19088/core.2021.007.
Texte intégralSchmidt-Sane, Megan, Tabitha Hrynick, Erica Nelson et Tom Barker. Mutual Learning for Policy Impact : Insights from CORE. Adapting research methods in the context of Covid-19. Institute of Development Studies (IDS), décembre 2021. http://dx.doi.org/10.19088/core.2021.008.
Texte intégralMeeker, Jessica. Mutual Learning for Policy Impact : Insights from CORE. Sharing Experience and Learning on Approaches to Influence Policy and Practice. Institute of Development Studies (IDS), août 2021. http://dx.doi.org/10.19088/core.2021.005.
Texte intégralTidd, Alexander N., Richard A. Ayers, Grant P. Course et Guy R. Pasco. Scottish Inshore Fisheries Integrated Data System (SIFIDS) : work package 6 final report development of a pilot relational data resource for the collation and interpretation of inshore fisheries data. Sous la direction de Mark James et Hannah Ladd-Jones. Marine Alliance for Science and Technology for Scotland (MASTS), 2019. http://dx.doi.org/10.15664/10023.23452.
Texte intégralGertler, Paul, Sebastian Martinez, Laura B. Rawlings, Patrick Premand et Christel M. J. Vermeersch. Impact Evaluation in Practice : Second Edition. Inter-American Development Bank, septembre 2016. http://dx.doi.org/10.18235/0006529.
Texte intégralMilek, Karen, et Richard Jones, dir. Science in Scottish Archaeology : ScARF Panel Report. Society of Antiquaries of Scotland, septembre 2012. http://dx.doi.org/10.9750/scarf.06.2012.193.
Texte intégralPaule, Bernard, Flourentzos Flourentzou, Tristan de KERCHOVE d’EXAERDE, Julien BOUTILLIER et Nicolo Ferrari. PRELUDE Roadmap for Building Renovation : set of rules for renovation actions to optimize building energy performance. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541614638.
Texte intégral