Acceder

Bibliografías temáticas / Online algorithms with recourse / Tesis

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Online algorithms with recourse.

Tesis sobre el tema "Online algorithms with recourse"

Autor: Grafiati

Publicado: 25 de mayo de 2024

Última modificación: 31 de julio de 2025

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores tesis para su investigación sobre el tema "Online algorithms with recourse".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Jin, Shendan. "Online computation beyond standard models." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS152.

Texto completo

Resumen

Dans le cadre standard du calcul en ligne, l’entrée de l’algorithme n’est pas entièrement connue à l’avance, mais elle est révélée progressivement sous forme d’une séquence de requêtes. Chaque fois qu'une requête arrive, l'algorithme en ligne doit prendre des décisions irrévocables pour servir la demande, sans connaissance des requêtes futures. Dans le domaine des algorithmes en ligne, le cadre standard utilisé pour évaluer les performances des algorithmes en ligne est l’analyse compétitive. De manière informelle, le concept d’analyse compétitive consiste à comparer les performances d’un algor

Los estilos APA, Harvard, Vancouver, ISO, etc.

2

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.

Texto completo

Resumen

Stochastic linear programs are linear programs in which some of the problem data are random variables. The particular kind of programs that we study belong to the recourse model. Under this model, some decisions are postponed until better information becomes available (e.g., an outcome of a random variable is realized), while other decisions must be made 'here and now.' For example, in a telecommunication network planning problem, decisions regarding the addition of network capacity have to be made before knowing customer demand (i.e., 'here and now'). Once the demand is realized, efficient us

Los estilos APA, Harvard, Vancouver, ISO, etc.

3

Li, Le. "Online stochastic algorithms." Thesis, Angers, 2018. http://www.theses.fr/2018ANGE0031.

Texto completo

Resumen

Cette thèse travaille principalement sur trois sujets. Le premier concentre sur le clustering en ligne dans lequel nous présentons un nouvel algorithme stochastique adaptatif pour regrouper des ensembles de données en ligne. Cet algorithme repose sur l'approche quasi-bayésienne, avec une estimation dynamique (i.e., dépendant du temps) du nombre de clusters. Nous prouvons que cet algorithme atteint une borne de regret de l'ordre et que cette borne est asymptotiquement minimax sous la contrainte sur le nombre de clusters. Nous proposons aussi une implémentation par RJMCMC. Le deuxième sujet est

Los estilos APA, Harvard, Vancouver, ISO, etc.

4

Shi, Tian. "Novel Algorithms for Understanding Online Reviews." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/104998.

Texto completo

Resumen

This dissertation focuses on the review understanding problem, which has gained attention from both industry and academia, and has found applications in many downstream tasks, such as recommendation, information retrieval and review summarization. In this dissertation, we aim to develop machine learning and natural language processing tools to understand and learn structured knowledge from unstructured reviews, which can be investigated in three research directions, including understanding review corpora, understanding review documents, and understanding review segments. For the corpus-level

Los estilos APA, Harvard, Vancouver, ISO, etc.

5

Sentenac, Flore. "Learning and Algorithms for Online Matching." Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAG005.

Texto completo

Resumen

Cette thèse se concentre principalement sur les problèmes d'appariement en ligne, où des ensembles de ressources sont alloués séquentiellement à des flux de demandes. Nous les traitons à la fois du point de vue de l'apprentissage en ligne et de l'analyse compétitive, toujours lorsqueEn ce qui concerne l'apprentissage en ligne, nous étudions comment la structure spécifique de l'appariement influence l'apprentissage dans la première partie, puis comment les effets de report dans le système affectent ses performances.En ce qui concerne l'analyse compétitive, nous étudions le problème de l'apparie

Los estilos APA, Harvard, Vancouver, ISO, etc.

6

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

7

Li, Rongbin, and 李榕滨. "New competitive algorithms for online job scheduling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/197555.

Texto completo

Resumen

Job scheduling, which greatly impacts on the system performance, is a fundamental problem in computer science. In this thesis, we study three kinds of scheduling problems, that is, deadline scheduling, due date scheduling, and flow time scheduling. Traditionally, the major concern for scheduling problems is the system performance, i.e. the “Quality of Service" (QoS). Different scheduling problems use different QoS measurements. For deadline scheduling, the most common QoS to optimize is the throughput; for due date scheduling, it is the total quoted lead time; and for flow time scheduling, it

Los estilos APA, Harvard, Vancouver, ISO, etc.

8

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.

Texto completo

Resumen

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Links 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. E

Los estilos APA, Harvard, Vancouver, ISO, etc.

9

Pasteris, S. U. "Efficient algorithms for online learning over graphs." Thesis, University College London (University of London), 2016. http://discovery.ucl.ac.uk/1516210/.

Texto completo

Resumen

In this thesis we consider the problem of online learning with labelled graphs, in particular designing algorithms that can perform this problem quickly and with low memory requirements. We consider the tasks of Classification (in which we are asked to predict the labels of vertices) and Similarity Prediction (in which we are asked to predict whether two given vertices have the same label). The first half of the thesis considers non- probabilistic online learning, where there is no probability distribution on the labelling and we bound the number of mistakes of an algorithm by a function of th

Los estilos APA, Harvard, Vancouver, ISO, etc.

10

Bonifaci, Vincenzo. "Models and algorithms for online server routing." Doctoral thesis, La Sapienza, 2007. http://hdl.handle.net/11573/917056.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

11

Harrington, 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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

12

Hung, Yee-shing Regant. "Scheduling online batching systems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B34624016.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

13

Kamphans, Thomas. "Models and algorithms for online exploration and search." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980408121.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

14

Birks, Martin David. "Online algorithms for temperature aware job scheduling problems." Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/27686.

Texto completo

Resumen

Temperature is an important consideration when designing microprocessors. When exposed to high temperatures component reliability can be reduced, while some components completely fail over certain temperatures. We consider the design and analysis of online algorithms; in particular algorithms that use knowledge of the amount of heat a job will generate. We consider algorithms with two main objectives. The first is maximising job throughput. We show upper and lower bounds for the case where jobs are unit length, both when jobs are weighted and unweighted. Many of these bounds are matching for a

Los estilos APA, Harvard, Vancouver, ISO, etc.

15

Zadimoghaddam, Morteza. "Online allocation algorithms with applications in computational advertising." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/87940.

Texto completo

Resumen

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 99-107).<br>Over the last few decades, a wide variety of allocation markets emerged from the Internet and introduced interesting algorithmic challenges, e.g., ad auctions, online dating markets, matching skilled workers to jobs, etc. I focus on the use of allocation algorithms in computational advertising as it is the quintessential application of my research. I will also touch on the class

Los estilos APA, Harvard, Vancouver, ISO, etc.

16

Packer, Heather S. "Evolving ontologies with online learning and forgetting algorithms." Thesis, University of Southampton, 2011. https://eprints.soton.ac.uk/194923/.

Texto completo

Resumen

Agents that require vocabularies to complete tasks can be limited by static vocabularies which cannot evolve to meet unforeseen domain tasks, or reflect its changing needs or environment. However, agents can benefit from using evolution algorithms to evolve their vocabularies, namely the ability to support new domain tasks. While an agent can capitalise on being able support more domain tasks, using existing techniques can hinder them because they do not consider the associated costs involved with evolving an agent's ontology. With this motivation, we explore the area of ontology evolution in

Los estilos APA, Harvard, Vancouver, ISO, etc.

17

Moon, Kyung Seob. "Consistency Maintenance Algorithms for Multiplayer Online Digital Games." Thesis, Griffith University, 2007. http://hdl.handle.net/10072/367081.

Texto completo

Resumen

Multiplayer Online Digital Games (MODIGs) are gaining in popularity because of the strategic sophistication added when games are played against other humans, as opposed to computer artificial intelligence (AI) opponents. However, the actualisation of multiplayer games is not easy, due to their complexity. Multiplayer games are the combined applications of various areas, such as networking, graphics, AI, sound, and process optimisation. Among them, problems related to networking -- such as limitations in data transfer rate, latency, and jitter -- are the most difficult to resolve. Network laten

Los estilos APA, Harvard, Vancouver, ISO, etc.

18

Chowuraya, Tawanda. "Online content clustering using variant K-Means Algorithms." Thesis, Cape Peninsula University of Technology, 2019. http://hdl.handle.net/20.500.11838/3089.

Texto completo

Resumen

Thesis (MTech)--Cape Peninsula University of Technology, 2019<br>We live at a time when so much information is created. Unfortunately, much of the information is redundant. There is a huge amount of online information in the form of news articles that discuss similar stories. The number of articles is projected to grow. The growth makes it difficult for a person to process all that information in order to update themselves on a subject matter. There is an overwhelming amount of similar information on the internet. There is need for a solution that can organize this similar information into spe

Los estilos APA, Harvard, Vancouver, ISO, etc.

19

Drapkin, Dimitri [Verfasser], Rüdiger [Akademischer Betreuer] Schultz, and Maarten H. van der [Akademischer Betreuer] Vlerk. "Models and algorithms for dominance-constrained stochastic programs with recourse / Dimitri Drapkin. Gutachter: Maarten H. van der Vlerk. Betreuer: Rüdiger Schultz." Duisburg, 2014. http://d-nb.info/105157966X/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

20

Mak, Kin-sum. "Energy efficient online deadline scheduling." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/HKUTO/record/B39558277.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

21

麥健心 and Kin-sum Mak. "Energy efficient online deadline scheduling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39558277.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

22

CESARI, TOMMASO RENATO. "ALGORITHMS, LEARNING, AND OPTIMIZATION." Doctoral thesis, Università degli Studi di Milano, 2020. http://hdl.handle.net/2434/699354.

Texto completo

Resumen

This thesis covers some algorithmic aspects of online machine learning and optimization. In Chapter 1 we design algorithms with state-of-the-art regret guarantees for the problem dynamic pricing. In Chapter 2 we move on to an asynchronous online learning setting in which only some of the agents in the network are active at each time step. We show that when information is shared among neighbors, knowledge about the graph structure might have a significantly different impact on learning rates depending on how agents are activated. In Chapter 3 we investigate the online problem of multivariate no

Los estilos APA, Harvard, Vancouver, ISO, etc.

23

Zhu, Jianqiao, and 朱剑桥. "New results on online job scheduling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50662351.

Texto completo

Resumen

This thesis presents several new results on online job scheduling. Job scheduling is a basic requirement of many practical computer systems, and the scheduling behavior directly affects a system’s performance. In theoretical aspect, scheduling scenarios are abstracted into scheduling models, which are studied mathematically. In this thesis, we look into a variety of scheduling models which are under active research. We incorporate these models and organize them into generalized pictures. We first study non-clairvoyant scheduling to minimize weighted flow time on two different multi-process

Los estilos APA, Harvard, Vancouver, ISO, etc.

24

Hung, Yee-shing Regant, and 洪宜成. "Scheduling online batching systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34624016.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

25

Okamoto, Kazuya. "Efficient Algorithms for Stable Matching and Online Scheduling Problems." 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/123858.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

26

Pietrzyk, Peter [Verfasser]. "Local and online algorithms for facility location / Peter Pietrzyk." Paderborn : Universitätsbibliothek, 2013. http://d-nb.info/1046073702/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

27

Wong, Chiu Wai M. Eng Massachusetts Institute of Technology. "Competitive algorithms for online matching and vertex cover problems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85521.

Texto completo

Resumen

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 73-75).<br>The past decade has witnessed an explosion of research on the online bipartite matching problem. Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before. One of the motivation for studying this problem is that it significantly generalizes the classical ski rental problem. An instance of such problems specifies a bipartite graph G =

Los estilos APA, Harvard, Vancouver, ISO, etc.

28

Renault, Marc Paul. "Lower and upper bounds for online algorithms with advice." Paris 7, 2014. http://www.theses.fr/2014PA077196.

Texto completo

Resumen

Les algorithmes en ligne fonctionnent dans un contexte où l'entrée est révélé au fur et à mesure du temps; chaque morceau révélé est appelé une demande. Après réception de chaque demahde, les algorithmes en ligne doivent prendre une action avant que la prochaine demande soit révélée, c'est-à-dire que les algorithmes en ligne doivent prendre une décision irrévocable basée sur les demandes déjà révélées sans aucune connaissance des demandes à venir. Le but est d'optimiser une fonction de coût dépendante de l'entrée. L'analyse compétitive est la méthode standard utilisée pour analyser la qualité

Los estilos APA, Harvard, Vancouver, ISO, etc.

29

Saint-Guillain, Michael. "Models and algorithms for online stochastic vehicle routing problems." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEI068.

Texto completo

Resumen

Quels seront les objectifs et défis des métropoles de demain ? La plupart des problèmes issus du monde réel sont sujets à l'inconnu, nécessitant de prendre de nouvelles décisions de façon dynamique, à la demande, en fonction des évènements aléatoires qui se réalisent. Dans cette thèse, nous nous attaquons à un problème majeur, du moins en perspectives: la gestion dynamique d'une flotte de véhicules en contexte urbain. Les applications pratiques des tournées de véhicules à la demande sont nombreuses, incluant les transports publics intelligents, les services de livraison, les soins et intervent

Los estilos APA, Harvard, Vancouver, ISO, etc.

30

Verschae, Tannenbaum Jose Claudio Verfasser], and Martin [Akademischer Betreuer] [Skutella. "The Power of Recourse in Online Optimization: Robust Solutions for Scheduling, Matroid and MST Problems / Jose Claudio Verschae Tannenbaum. Betreuer: Martin Skutella." Berlin : Universitätsbibliothek der Technischen Universität Berlin, 2012. http://d-nb.info/1020057424/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

31

Cunningham, James. "Efficient, Parameter-Free Online Clustering." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1606762403895603.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

32

San, Felice Mário César 1985. "Online facility location and Steiner problems = Problemas online de localização de instalações e de Steiner." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275552.

Texto completo

Resumen

Orientador: Orlando Lee<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-27T12:18:11Z (GMT). No. of bitstreams: 1 SanFelice_MarioCesar_D.pdf: 1457706 bytes, checksum: 4813f4ed44c52462656d56537d73d5dc (MD5) Previous issue date: 2015<br>Resumo: Nesta tese estudamos problemas online das famílias de localização de instalações e de Steiner, através da abordagem de análise competitiva. O objetivo nestes problemas é construir uma rede de custo mínimo para atender a uma determinada demanda. Nós apresentamos resultados conhecidos

Los estilos APA, Harvard, Vancouver, ISO, etc.

33

Kamphans, Tom [Verfasser]. "Models and Algorithms for Online Exploration and Search / Tom Kamphans." Aachen : Shaker, 2011. http://d-nb.info/1098040260/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

34

Han, Xin. "Online and approximation algorithms for bin-packing and knapsack problems." 京都大学 (Kyoto University), 2007. http://hdl.handle.net/2433/135979.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

35

Saintillan, Yves. "Performance evaluation of online call routing and admission control algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0005/MQ43558.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

36

Angelopoulos, Spyros. "Efficient online algorithms for multicasting with bandwidth and delay guarantees." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0004/MQ45942.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

37

Liu, Ming. "Design and Evaluation of Algorithms for Online Machine Scheduling Problems." Phd thesis, Ecole Centrale Paris, 2009. http://tel.archives-ouvertes.fr/tel-00453316.

Texto completo

Resumen

Dans cette thèse, nous proposons et évaluons des algorithmes pour résoudre des problèmes d'ordonnancement en ligne. Pendant des décennies, les études en ordonnancement considèrent des modèles déterministes où toutes les informations nécessaires pour la définition du problème sont supposées connues à l'avance. Cette hypothèse n'est généralement pas réaliste. Ceci a motivé les études sur l'ordonnancement en ligne. Dans un problème d'ordonnancement en ligne, un algorithme doit prendre des décisions sans connaissance du futur. L'analyse compétitive est généralement la méthode utilisée pour évaluer

Los estilos APA, Harvard, Vancouver, ISO, etc.

38

Bender, Marco [Verfasser]. "Randomized Approximation and Online Algorithms for Assignment Problems / Marco Bender." München : Verlag Dr. Hut, 2015. http://d-nb.info/1074063333/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

39

Lee, Lap-kei, and 李立基. "New results on online job scheduling and data stream algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B42182451.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

40

Chan, Sze-hang, and 陳思行. "Competitive online job scheduling algorithms under different energy management models." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/206690.

Texto completo

Resumen

Online flow-time scheduling is a fundamental problem in computer science and has been extensively studied for years. It is about how to design a scheduler to serve computer jobs with unpredictable arrival times and varying sizes and priorities so as to minimize the total flow time (better understood as response time) of jobs. It has many applications, most notable in the operating of server farms. As energy has become an important issue, the design of scheduler also has to take power management into consideration, for example, how to scale the speed of the processors dynamically. The objective

Los estilos APA, Harvard, Vancouver, ISO, etc.

41

Lee, Lap-kei. "New results on online job scheduling and data stream algorithms." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B42182451.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

42

Liu, Ming Chu Chengbin. "Design and Evaluation of Algorithms for Online Machine Scheduling Problems." S. l. : S. n, 2009. http://theses.abes.fr/2009ECAP0028.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

43

Havill, Jessen Tait. "Analysis of algorithms for online routing and scheduling in networks." W&M ScholarWorks, 1998. https://scholarworks.wm.edu/etd/1539623929.

Texto completo

Resumen

We study situations in which an algorithm must make decisions about how to best route and schedule data transfer requests in a communication network before each transfer leaves its source. For some situations, such as those requiring quality of service guarantees, this is essential. For other situations, doing work in advance can simplify decisions in transit and increase the speed of the network. In order to reflect realistic scenarios, we require that our algorithms be online, or make their decisions without knowing future requests. We measure the efficiency of an online algorithm by its com

Los estilos APA, Harvard, Vancouver, ISO, etc.

44

Zhang, Lele. "On-line scheduling with constraints /." Connect to thesis, 2009. http://repository.unimelb.edu.au/10187/3538.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

45

Fung, Ping-yuen. "Online algorithms for the provision of quality of service in networks." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B3158052X.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

46

Minerva, Michela. "Automated Configuration of Offline/Online Algorithms: an Empirical Model Learning Approach." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22649/.

Texto completo

Resumen

The energy management system is the intelligent core of a virtual power plant and it manages power flows among units in the grid. This implies dealing with optimization under uncertainty because entities such as loads and renewable energy resources have stochastic behaviors. A hybrid offline/online optimization technique can be applied in such problems to ensure efficient online computation. This work devises an approach that integrates machine learning and optimization models to perform automatic algorithm configuration. It is inserted as the top component in a two-level hierarchical optimiz

Los estilos APA, Harvard, Vancouver, ISO, etc.

47

Ochel, Marcel [Verfasser]. "Approximation and online algorithms for selected network optimization problems / Marcel Ochel." Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2013. http://d-nb.info/1035688484/34.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

48

Fung, Ping-yuen, and 馮秉遠. "Online algorithms for the provision of quality of service in networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B3158052X.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

49

HANDA, MANISH. "ONLINE PLACEMENT AND SCHEDULING ALGORITHMS AND METHODOLOGIES FOR RECONFIGURABLE COMPUTING SYSTEMS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1100030953.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

50

Schroeder, Pascal. "Performance guaranteeing algorithms for solving online decision problems in financial systems." Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0143.

Texto completo

Resumen

Cette thèse contient quelques problèmes de décision financière en ligne et des solutions. Les problèmes sont formulés comme des problèmes en ligne (OP) et des algorithmes en ligne (OA) sont créés pour résoudre. Comme il peut y avoir plusieurs OAs pour le même OP, il doit y avoir un critère afin de pouvoir faire des indications au sujet de la qualité d’un OA. Dans cette thèse ces critères sont le ratio compétitif (c), la différence compétitive (cd) et la performance numérique. Un OA qui a un c ou cd plus bas qu’un autre est à préférer. Un OA qui possède le c le plus petit est appelé optimal. No

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!