Tesi sul tema "Online problems"
Segui questo link per vedere altri tipi di pubblicazioni sul tema: Online problems.
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Online problems".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
1
Lu, Xin Ph D. Massachusetts Institute of Technology Operations Research Center. "Online optimization problems". Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82724.
Abstract (sommario):
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-153).
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, including traveling salesman problems with rejection options, generalized assignment problems, stochastic matching problems, and resource allocation problems. We use worst case competitive ratios to analyze the performance of proposed algorithms. We begin our study with online traveling salesman problems with rejection options where acceptance/rejection decisions are not required to be explicitly made. We propose an online algorithm in arbitrary metric spaces, and show that it is the best possible. We then consider problems where acceptance/rejection decisions must be made at the time when requests arrive. For dierent metric spaces, we propose dierent online algorithms, some of which are asymptotically optimal. We then consider generalized online assignment problems with budget constraints and resource constraints. We first prove that all online algorithms are arbitrarily bad for general cases. Then, under some assumptions, we propose, analyze, and empirically compare two online algorithms, a greedy algorithm and a primal dual algorithm. We study online stochastic matching problems. Instances with a fixed number of arrivals are studied first. A novel algorithm based on discretization is proposed and analyzed for unweighted problems. The same algorithm is modified to accommodate vertex-weighted cases. Finally, we consider cases where arrivals follow a Poisson Process. Finally, we consider online resource allocation problems. We first consider the problems with free but fixed inventory under certain assumptions, and present near optimal algorithms. We then relax some unrealistic assumptions. Finally, we generalize the technique to problems with flexible inventory with non-decreasing marginal costs.
by Xin Lu.
Ph.D.
2
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.
Abstract (sommario):
Orientador: Orlando LeeTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
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
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 para o problema Online da Localização de Instalações (OFL), o problema Online da Árvore de Steiner (OST) e o problema Online Single-Source Rent-or-Buy (OSRoB). O OFL consiste em atender a um conjunto de clientes, através da abertura de algumas instalações e da conexão de cada cliente com uma instalação aberta. O OST tem por objetivo conectar um conjunto de terminais utilizando uma árvore, que pode conter vértices não terminais, chamados vértices de Steiner. O OSRoB é uma versão rent-or-buy do OST, onde todos os terminais devem ser conectados a um nó especial chamado raíz. Os algoritmos e técnicas que apresentamos para estes problemas são importantes no desenvolvimento dos nossos algoritmos para os problemas que consideramos. Apresentamos novos resultados para o problema Online da Localização de Instalações com Coleta de Prêmios (OPFL), o problema Online da Árvore Estrela de Steiner (OSTS), e o problema Online da Localização de Instalações Conectadas (OCFL). O OPFL é uma generalização do OFL, em que alguns clientes podem ficar desconectados mediante o pagamento de penalidades. O OSTS é uma variante do OST, em que os vértices possuem custos não negativos. O OCFL é uma combinação do OFL e do OST, em que um conjunto de clientes precisa ser atendido através da abertura de algumas instalações, da conexão de cada cliente com uma instalação aberta, e da construção de uma árvore, mais custosa, que conecta as instalações abertas
Abstract: In this thesis we study online problems from the facility location and Steiner families, through the point of view of competitive analysis. The goal in these problems is to build a minimum cost network to attend a certain demand. We present known results for the Online Facility Location problem (OFL), the Online Steiner Tree problem (OST) and the Online Single-Source Rent-or-Buy problem (OSRoB). The OFL consists of serving a set of clients by opening some facilities and by connecting each client to a facility. The OST aims to connect a set of terminals in order to create a tree network, that may contain nonterminals, called Steiner nodes. The OSRoB is a rent-or-buy version of the OST, in which all terminals must be connected to a special node called root. The algorithms and techniques that we present for these problems play an important role in the design of our algorithms for the problems we consider. We present new results for the Online Prize-Collecting Facility Location problem (OPFL), the Online Steiner Tree Star problem (OSTS), and the Online Connected Facility Location problem (OCFL). The OPFL is a generalization of the OFL, in which some clients may be left unconnected by paying a penalty. The OSTS is a variant of the OST, in which the nodes have non-negative costs. The OCFL is a combination of the OFL and the OST, in which a set of clients needs to be served by opening some facilities, by connecting each client to a facility, and by creating a more expensive tree network that connects the open facilities
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
3
Winter, Thomas. "Online and real-time dispatching problems". [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=958326584.
4
Asan, N. Evren. "Offline And Online Disk Scheduling Problems". Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607909/index.pdf.
Abstract (sommario):
This thesis considers the disk scheduling problem. The problem is investigated in two types of settings: offline and online. We first adopt the traveling salesman problem with time windows in the scheduling literature for solving the offline problem. Then we develop a decision epoch scheme in which offline problems are iteratively used in solving the online problem. We perform an experimental study for our approach and two well-known disk scheduling algorithms, and compare them according to several performance criteria.
5
Charalambous, George. "Online and verification problems under uncertainty". Thesis, University of Leicester, 2016. http://hdl.handle.net/2381/38096.
Abstract (sommario):
In the under uncertainty setting we study problems with imprecise input data for which precise data can be obtained. There exists an underlying problem with a feasible solution, but is computable only if the input is precise enough. We are interested in measuring how much of the imprecise input data has to be updated in order to be precise enough. We look at the problem for both the online and the offline (verification) cases. In the verification under uncertainty setting an algorithm is given imprecise input data and also an assumed set of precise input data. The aim of the algorithm is to update the smallest number of input data such that if the updated input data is the same as the corresponding assumed input data (i.e. verified), a solution for the underlying problem can be calculated. In the online adaptive under uncertainty setting the task is similar except the assumed set of precise data is not given to the algorithm, and the performance of the algorithm is measured by comparing the number of input data that have been updated against the result obtained in the verification setting of the same problem. We have studied these settings for a few geometric and graph problems and found interesting results. Geometric problems include several variations of the maximal points problem where, in its classical form, given a set of points in the plane we want to compute the set of all points that are maximal. The uncertain element here is the actual location of each point. Graph problems include a few variations of the graph diameter problem where, in its classical form, given a graph we want to calculate a farthest pair of vertices. The uncertain element is the weight of each edge.
6
Clements, Andrea D., e Steve Cockerham. "Problems (and solutions) in Online Teaching". Digital Commons @ East Tennessee State University, 2001. https://dc.etsu.edu/etsu-works/7310.
7
Kobayashi, Koji. "Competitive Analysis of Online Problems on Networks". 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/123835.
8
Kleinberg, Robert David. "Online decision problems with large strategy sets". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33092.
Abstract (sommario):
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.Includes bibliographical references (p. 165-171).
In an online decision problem, an algorithm performs a sequence of trials, each of which involves selecting one element from a fixed set of alternatives (the "strategy set") whose costs vary over time. After T trials, the combined cost of the algorithm's choices is compared with that of the single strategy whose combined cost is minimum. Their difference is called regret, and one seeks algorithms which are efficient in that their regret is sublinear in T and polynomial in the problem size. We study an important class of online decision problems called generalized multi- armed bandit problems. In the past such problems have found applications in areas as diverse as statistics, computer science, economic theory, and medical decision-making. Most existing algorithms were efficient only in the case of a small (i.e. polynomial- sized) strategy set. We extend the theory by supplying non-trivial algorithms and lower bounds for cases in which the strategy set is much larger (exponential or infinite) and the cost function class is structured, e.g. by constraining the cost functions to be linear or convex. As applications, we consider adaptive routing in networks, adaptive pricing in electronic markets, and collaborative decision-making by untrusting peers in a dynamic environment.
by Robert David Kleinberg.
Ph.D.
9
Daly, Katharine M. "Hand-drawn graph problems in online education". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100303.
Abstract (sommario):
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 104-106).
Machine-gradable assessments in online education platforms are currently limited to questions that require only keyboard or mouse input, and grading efforts generally focus only on final answers. Some types of problems in the science, technology, engineering, and math (STEM) domain, however, are most naturally answered through sketches drawn with a pen. We introduce a simple graph problem type that accepts solutions drawn using a stylus as a proof-of-concept extension to online education platforms. Simple graphs have a small number of components (vertices, arrows, and edges only), and we describe a three-step recognition process consisting of segmentation, symbol classication, and domain interpretation for converting users' pen strokes into a simple graph object representation. An experiment run on Mechanical Turk demonstrates the usability of our trained, recognition-driven drawing interface, and examples of simple graph problems illustrate how course developers can not only check students' final answers but also provide students with intermediate feedback.
by Katharine M. Daly.
M. Eng.
10
Korolko, Nikita (Nikita E. ). "A robust optimization approach to online problems". Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112013.
Abstract (sommario):
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2017.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-155).
In this thesis, we consider online optimization problems that are characterized by incrementally revealed input data and sequential irrevocable decisions that must be made without complete knowledge of the future. We employ a combination of mixed integer optimization (MIO) and robust optimization (RO) methodologies in order to design new efficient online algorithms that outperform state-of-the-art methods for many important practical applications. We empirically demonstrate that RO-based algorithms are computationally tractable for instances of practical size, generate more cost-effective decisions and can simultaneously model a large class of similar online problems due to exceptional modeling power of MIO. In Part I, we consider the well-known K-server problem from the perspective of robust adaptive optimization. We propose a new tractable mixed integer linear formulation of the K-server problem that incorporates both information from the past and uncertainty about the future. By combining ideas from classical online algorithms developed in the computer science literature and robust and adaptive optimization developed in the operations research literature we propose a new method that (a) is computationally tractable, (b) almost always outperforms all other methods in numerical experiments, and (c) is stable with respect to potential errors in the assumptions about the future. In Part II, we consider several extensions of the asset-based weapon-to-target assignment problem whose objective is to protect ships in a fleet from incoming threats. We demonstrate that the new highly nonlinear MIO formulation (a) can be combined with lazy constraints techniques allowing the system designer to find optimal solutions in real time, (b) can be extended to the multi-period setting, and (c) admits a decentralized solution with limited loss of optimality. In Part III, we present a novel covariate-adaptive optimization algorithm for online allocation in clinical trials. The new approach leveraging MIO and RO techniques (a) guarantees a better between-group covariate balance in comparison with state-of- the-art methods, (b) yields statistical power at least as high as, and sometimes significantly higher than, randomization-based algorithms, and (c) is well protected against selection, investigator and accidental bias.
by Nikita Korolko.
Ph. D.
11
Clements, Andrea D. "Problems (and solutions) in Online Teaching II". Digital Commons @ East Tennessee State University, 2002. https://dc.etsu.edu/etsu-works/7307.
12
Kawahara, Jun. "Automated Competitive Analysis of Online Knapsack Problems and Randomized k-server Problems". 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/123859.
13
Yonezawa, Kouki. "Studies on online financial and server-location problems". 京都大学 (Kyoto University), 2004. http://hdl.handle.net/2433/145308.
Abstract (sommario):
Kyoto University (京都大学)0048
新制・課程博士
博士(情報学)
甲第11080号
情博第125号
新制||情||29(附属図書館)
22612
UT51-2004-J752
京都大学大学院情報学研究科通信情報システム専攻
(主査)教授 岩間 一雄, 教授 富田 眞治, 教授 湯淺 太一
学位規則第4条第1項該当
14
Harks, Tobias. "Multicommodity routing problems selfish behavior and online aspects". Göttingen Cuvillier, 2007.
15
Birks, Martin David. "Online algorithms for temperature aware job scheduling problems". Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/27686.
Abstract (sommario):
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 all cooling factors in the single and multiple machine case. We extend this to consider the single machine case where jobs have longer than unit length. When all jobs are equal length we show matching bounds for the case without preemption. We also show that both models of pre-emption enable at most a slight reduction in the competitive ratio of algorithms. We then consider when jobs have variable lengths. We analyse both the models of unweighted jobs and the jobs with weights proportional to their length. We show bounds that match within constant factors, in the non-preemptive and both preemptive models. The second objective we consider is minimising flow time. We consider the objective of minimising the total flow time of a schedule. We show NP-hardness and inapproximability results for the offline case, as well as giving an approximation algorithm for the case where all release times are equal. For the online case we give some negative results for the case where maximum job heats are bounded. We also give some results for a resource augmentation model that include a 1-competitive algorithm when the extra power for the online algorithm is high enough. Finally we consider the objective of minimising the maximum flow time of any job in a schedule.
16
Okamoto, Kazuya. "Efficient Algorithms for Stable Matching and Online Scheduling Problems". 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/123858.
17
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.
Abstract (sommario):
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 73-75).
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 = (L, R, E) whose left vertices L are offline and right vertices arrive online one at a time. An algorithm must maintain a valid vertex cover from which no vertex can ever be removed. The objective is to minimize the size of the cover. In this thesis, we introduce a charging-based algorithmic framework for this problem as well as its generalizations. One immediate outcome is a simple analysis of an optimal 1/1-1/e- competitive algorithm for online bipartite vertex cover. By extending the charging-based analysis in various nontrivial ways, we also obtain optimal l_1 e-competitive algorithms for the edge-weighted and submodular versions of online bipartite vertex cover, which all match the best performance of ski rental. As an application, we show that by analyzing our algorithm in the primal-dual framework, our result on submodular vertex cover implies an optimal (1/1-1/e)-competitive algorithm for its dual, online bipartite submodular matching. This problem is a generalization of online bipartite matching and may have applications in display ad allocation. We consider also the more general scenario where all the vertices are online and the graph is not necessarily bipartite, which is known as the online fractional vertex cover and matching problems. Our contribution in this direction is a primal-dual 1.901-competitive (or 1/1.901 ~~ 0.526) algorithm for these problems. Previously, it was only known that they admit a simple well-known 2-competitive (or 1/2) greedy algorithm. Our result is the first successful attempt to beat the greedy algorithm for these two problems. Moreover, our algorithm for the online matching problem significantly generalizes the traditional online bipartite graph matching problem, where vertices from only one side of the bipartite graph arrive online. In particular, our algorithm improves upon the result of the fractional version of the online edge-selection problem in Blum et. al. (JACM '06). Finally, on the hardness side, we show that no randomized online algorithm can achieve a competitive ratio better than 1.753 and 0.625 for the online fractional vertex cover problem and the online fractional matching problem respectively, even for bipartite graphs.
by Chiu Wai Wong.
M. Eng.
18
Aleksandrov, Martin Damyanov. "Heuristics and policies for online pickup and delivery problems". Master's thesis, Faculdade de Ciências e Tecnologia, 2012. http://hdl.handle.net/10362/8197.
Abstract (sommario):
Master ThesisIn the last few decades, increased attention has been dedicated to a speci c subclass of Vehicle Routing Problems due to its signi cant importance in several transportation areas such as taxi companies, courier companies, transportation of people, organ transportation, etc. These problems are characterized by their dynamicity as the demands are, in general, unknown in advance and the corresponding locations are paired. This thesis addresses a version of such Dynamic Pickup and Delivery Problems, motivated by a problem arisen in an Australian courier company, which operates in Sydney, Melbourne and Brisbane, where almost every day more than a thousand transportation orders arrive and need to be accommodated. The rm has a eet of almost two hundred vehicles of various types, mostly operating within the city areas. Thus, whenever new orders arrive at the system the dispatchers face a complex decision regarding the allocation of the new customers within the distribution routes (already existing or new) taking into account a complex multi-level objective function. The thesis thus focuses on the process of learning simple dispatch heuristics, and lays the foundations of a recommendation system able to rank such heuristics. We implemented eight of these, observing di erent characteristics of the current eet and orders. It incorporates an arti cial neural network that is trained on two hundred days of past data, and is supervised by schedules produced by an oracle, Indigo, which is a system able to produce suboptimal solutions to problem instances. The system opens the possibility for many dispatch policies to be implemented that are based on this rule ranking, and helps dispatchers to manage the vehicles of the eet. It also provides results for the human resources required each single day and within the di erent periods of the day. We complement the quite promising results obtained with a discussion on future additions and improvements such as channel eet management, tra c consideration, and learning hyper-heuristics to control simple rule sequences.
The thesis work was partially supported by the National ICT Australia according to the Visitor Research Agreement contract between NICTA and Martin Damyanov Aleksandrov
19
Saint-Guillain, Michael. "Models and algorithms for online stochastic vehicle routing problems". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEI068.
Abstract (sommario):
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 interventions à domicile, etc. Étant donnés une flotte de véhicules et un ensemble de clients, chacun pouvant potentiellement et à tout moment émettre une requête nécessitant une intervention, l'objectif de cette thèse est de fournir une réponse à la question suivante. Étant donné l'état courant à un moment donné, comment gérer notre flotte de véhicules afin de maximiser l'espérance du nombre total de requêtes satisfaites à la fin de la journée ? Ou encore, comment minimiser l'espérance du délai moyen d'intervention de nos véhicules ? Bien entendu, la difficulté réside en ce que la plupart des requêtes, avant d'apparaître dynamiquement, ne sont pas connues. Pour chaque problème, nous considérons qu'il nous est fourni une connaissance, sous forme d'information probabiliste, telle que la probabilité qu'une requête apparaisse à un certain endroit, et à un certain moment de la journée. Grâce à des techniques issues de la recherche opérationnelle et de la programmation stochastique, nous sommes en mesure de construire et résoudre des modèles calculant les actions anticipatives les plus adéquates, comme le redéploiement préventif des véhicules, minimisant le coût total espéré, ou encore maximisant la qualité de service. La question de l'optimisation sous incertitude se pose depuis déjà plusieurs décennies. Grâce aux avancées à la fois théoriques et technologiques, nous sommes chaque jour un peu plus en mesure de palier à l'inconnu. Cependant, la plupart des problèmes intéressants restent extrêmement difficiles à résoudre, si ce n'est impossible. Il reste beaucoup à faire. Cette thèse explore certains concepts fondamentaux de l'optimisation sous incertitude. En intégrant une composante stochastique aux modèles à optimiser, nous verrons ensemble comment il est en effet possible de créer de l'anticipationWhat will be tomorrow's big cities objectives and challenges? Most of the operational problems from the real world are inherently subject to uncertainty, requiring the decision system to compute new decisions dynamically, as random events occur. In this thesis, we aim at tackling an important growing problem in urban context: online dynamic vehicle routing. Applications of online vehicle routing in the society are manyfold, from intelligent on demand public transportation to sameday delivery services and responsive home healthcare. Given a fleet of vehicles and a set of customers, each being potentially able to request a service at any moment, the current thesis aims at answering the following question. Provided the current state at some moment of the day, which are the best vehicle actions such that the expected number of satisfied requests is maximized by the end of the operational day? How can we minimize the expected average intervention delays of our mobile units? Naturally, most of the requests remain unknown until they appear, hence being revealed online. We assume a stochastic knowledge on each operational problem we tackle, such as the probability that customer request arise at a given location and a given time of the day. By using techniques from operations research and stochastic programming, we are able to build and solve mathematical models that compute near-optimal anticipative actions, such as preventive vehicle relocations, in order to either minimize the overall expected costs or maximize the quality of service. Optimization under uncertainty is definitely not a recent issue. Thanks to evolution of both theoretical and technological tools, our ability to face the unknown constantly grows. However, most of the interesting problems remain extremely hard, if not impossible, to solve. There is still a lot of work. Generally speaking, this thesis explores some fundamentals of optimization under uncertainty. By integrating a stochastic component into the models to be optimized, we will see how it is in fact possible to create anticipation
20
Herling, Jessica Lauren. "Online Community Response to YouTube Abuse". Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/78126.
Abstract (sommario):
This study draws on social problems literature about rhetoric in claims-making and social movement literature about credibility in framing to understand the construction of YouTube abuse and relationships between member role in the community and their frames/the reception of those frames. I also draw on feminist, non-feminist, and postfeminist literature to understand how YouTubers incorporate feminism into their claims about why YouTube abuse is wrong. Here feminism refers to understandings of sexual harassment as stemming from gender inequality, and non-feminist understandings of sexual harassment refer to individualized and degendered violations of rights and power imbalances. Postfeminist literature informs this study in understanding how a feminist issue has been disassociated with gender inequality and individualized. Drawing on this literature, I conducted a content analysis of YouTube videos and the comment sections on these YouTube video webpages to address how the community members responded to the sexual harassment problem. First, how do the YouTubers describe the problem? Second, what explanations for why the behavior is wrong, do the YouTubers use? Options include portraying the issue using a more feminist frame of "gender equality," a post-feminist frame of gender-neutral "consent," or a gender-neutral frame of "power imbalance." Lastly, are there relationships between the YouTubers' position in the community and/or gender, their responses, and positive and negative comments left on the videos? Analysis supports that YouTubers did not connect the issue to feminism and that YouTubers' positions in the community relate to how they politicized the abuse and how much commentator support they received.Master of Science
21
Tripathi, Pushkar. "Allocation problems with partial information". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44789.
Abstract (sommario):
Allocation problems have been central to the development of the theory of algorithms and also find applications in several realms of computer science and economics. In this thesis we initiate a systematic study of these problems in situations with limited information.
Towards this end we explore several modes by which data may be obfuscated from the algorithm. We begin by investigating temporal constraints where data is revealed to the algorithm over time. Concretely, we consider the online bipartite matching problem in the unknown distribution model and present the first algorithm that breaches the 1-1/e barrier for this problem.
Next we study issues arising from data acquisition costs that are prevalent in ad-systems and kidney exchanges. Motivated by these constraints we introduce the query-commit model and present constant factor algorithms for the maximum matching and the adwords problem in this model.
Finally we assess the approximability of several classical allocation problems with multiple agents having complex non-linear cost functions. This presents an additional obstacle since the support for the cost functions may be extremely large entailing oracle access. We show tight information theoretic lower bounds for the general class of submodular functions and also extend these results to get lower bounds for a subclass of succinctly representable non-linear cost functions.
22
Han, Xin. "Online and approximation algorithms for bin-packing and knapsack problems". 京都大学 (Kyoto University), 2007. http://hdl.handle.net/2433/135979.
23
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.
Abstract (sommario):
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 les performances de tels algorithmes. Dans cette analyse, la performance d'un algorithme en ligne est mesurée par le ratio compétitif qui est le ratio dans le pire cas entre la performance de la solution obtenue et celle d'une solution optimale hors ligne. Nous considérons principalement deux paradigmes en ligne: celui où les tâches se présentent dans la liste et celui où les tâches arrivent au fur et à mesure. Sur la base de ces deux paradigmes, nous considérons différents modèles : une seule machine, deux machines identiques parallèles, deux machines uniformes parallèles, batch machines et open shop. Pour chacun des problèmes, nous démontrons une borne inférieure de ratios compétitifs et proposons des algorithmes en ligne. Ensuite, nous évaluons la performance de ces algorithmes à l'aide de l'analyse compétitive. Pour certains problèmes, nous montrons que les algorithmes proposés sont optimaux dans le sens où le ratio compétitif est égal à la borne inférieure.
24
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.
25
Liu, Ming Chu Chengbin. "Design and Evaluation of Algorithms for Online Machine Scheduling Problems". S. l. : S. n, 2009. http://theses.abes.fr/2009ECAP0028.
26
Verdugo, Silva Víctor Ignacio. "Convex and online optimization: Applications to scheduling and selection problems". Tesis, Universidad de Chile, 2018. http://repositorio.uchile.cl/handle/2250/168128.
Abstract (sommario):
Doctor en Sistemas de Ingeniería en cotutela con Ecole Normale SupérieureConvex optimization has been a powerful tool for designing algorithms. In practice is a widely used in areas such as operations research and machine learning, but also in many fundamental combinatorial problems they yield to the best know approximations algorithms providing unconditional guarantees over the solution quality. In the first part of this work we study the effect of constructing convex relaxations to a packing problem, based on applying lift & project methods. We exhibit a weakness of this relaxations when they are obtained from the natural formulations of this problem, by showing the impossibility of reducing the gap even when this relaxations are very large. We provide a way of combining symmetry breaking procedures and lift & project methods to obtain arbitrarily good gaps. In the second part of this thesis we study online selection problems, that is, elements arrive over time and we have to select some of them, irrevocably, in order to meet some combinatorial constraints, but also trying to maximize the quality of the selection. Usually this quality in measured in terms of weight, but we consider a stronger variant in which weights are not necessarily known because of information availability. Instead, as long as we can rank the elements, we can provide a general framework to obtain approximation algorithms with good competitive ratios in many contexts.
27
Schmitz, Sandra [Verfasser]. "The Struggle in Online Copyright Enforcement : Problems and Prospects / Sandra Schmitz". Baden-Baden : Nomos Verlagsgesellschaft mbH & Co. KG, 2015. http://d-nb.info/1106340493/34.
28
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.
29
He, Tingting, e 何婷婷. "A study on several problems in online handwritten Chinese character recognition". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B42182086.
30
Schmitz, Sandra V. I. [Verfasser]. "The Struggle in Online Copyright Enforcement : Problems and Prospects / Sandra Schmitz". Baden-Baden : Nomos Verlagsgesellschaft mbH & Co. KG, 2015. http://nbn-resolving.de/urn:nbn:de:101:1-201607136654.
31
Fergus, Seamus. "Internet Safety for Children : Stranger danger, misbehaviour and problems when online". Thesis, Luleå tekniska universitet, Datavetenskap, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-70126.
Abstract (sommario):
The Internet has evolved and continues to evolve rapidly and as adults we understand the need to be careful with various issues including our privacy, scams, bullying and as adults we stumble across unwanted material that might be considered inappropriate. Children also need to be protected and this thesis will research what children do when they are online, and what protection is currently given to children. The research will also include input from teachers and parents and find out what experiences they have and what they are doing to protect children. The thesis will involve software testing to evaluate how effective parental control software is, and possibilities of it being hacked. This research will concentrate on smartphones, and in particular the Android operating system, the reason is that Android phones can be purchased cheaper than an iPhone, and therefore are more likely to be used by a child. A developer’s version of Android can also be configured to run it in a virtual machine running on a PC which makes various testing possible. The thesis will also involve reviewing other organisation’s research and findings and how it compares to my own research. The thesis will give advice on how to move forward in relation to keeping children safe online.
32
He, Tingting. "A study on several problems in online handwritten Chinese character recognition". Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B42182086.
33
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.
Abstract (sommario):
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. Nous considérons les OPs suivants. Le problème de conversion en ligne (OCP), le problème de sélection de portefeuille en ligne (PSP) et le problème de gestion de trésorerie en ligne (CMP). Après le premier chapitre d’introduction, les OPs, la notation et l’état des arts dans le champ des OPs sont présentés. Dans le troisième chapitre on résoudre trois variantes des OCP avec des prix interconnectés. En Chapitre 4 on travaille encore sur le problème de recherche de série chronologie avec des prix interconnectés et on construit des nouveaux OAs. À la fin de ce chapitre l’OA k-DIV est créé pour le problème de recherche générale des k maximums. k-DIV est aussi optimal. En Chapitre 5 on résout le PSP avec des prix interconnectés. L’OA créé s’appelle OPIP et est optimal. En utilisant les idées de OPIP, on construit un OA pour le problème d’échange bidirectionnel qui s’appelle OCIP et qui est optimal. Avec OPIP, on construit un OA optimal pour le problème de recherche bidirectionnel (OA BUND) sachant les valeurs de θ_1 et θ_2. Pour des valeurs inconnues, on construit l’OA RUN qui est aussi optimal. Les chapitres 6 et 7 traitent sur le CMP. Dans les deux chapitres il y a des tests numériques afin de pouvoir comparer la performance des OAs nouveaux avec celle des OAs déjà établies. En Chapitre 6 on construit des OAs optimaux ; en chapitre 7 on construit des OA qui minimisent cd. L’OA BCSID résoudre le CMP avec des demandes interconnectées ; LOA aBBCSID résoudre le problème lorsqu’ on connaît les valeurs de θ_1,θ_2,m et M. L’OA n’est pas optimal. En Chapitre 7 on résout le CMP par rapport à m et M en minimisant cd (OA MRBD). Ensuite on construit l’OA HMRID et l’OA MRID pour des demandes interconnectées. MRID minimise cd et HMRID est un bon compromis entre la performance numérique et la minimisation de cdThis thesis contains several online financial decision problems and their solutions. The problems are formulated as online problems (OP) and online algorithms (OA) are created to solve them. Due to the fact that there can be various OA for the same OP, there must be some criteria with which one can make statements about the quality of an OA. In this thesis these criteria are the competitive ratio (c), the competitive difference (cd) and the numerical performance. An OA with a lower c is preferable to another one with a higher value. An OA that has the lowest c is called optimal. We consider the following OPS. The online conversion problem (OCP), the online portfolio selection problem (PSP) and the cash management problem (CMP). After the introductory chapter, the OPs, the notation and the state of the art in the field of OPs is presented. In the third chapter, three variants of the OCP with interrelated prices are solved. In the fourth chapter the time series search with interrelated prices is revisited and new algorithms are created. At the end of the chapter, the optimal OA k-DIV for the general k-max search with interrelated prices is developed. In Chapter 5 the PSP with interrelated prices is solved. The created OA OPIP is optimal. Using the idea of OPIP, an optimal OA for the two-way trading is created (OCIP). Having OCIP, an optimal OA for the bi-directional search knowing the values of θ_1 and θ_2 is created (BUND). For unknown θ_1 and θ_2, the optimal OA RUNis created. The chapter ends with an empirical (for OPIP) and experimental (for OCIP, BUND and RUN) testing. Chapters 6 and 7 deal with the CMP. In both of them, a numerical testing is done in order to compare the numerical performance of the new OAs to the one of the already established ones. In Chapter 6 an optimal OA is constructed; in Chapter 7, OAs are designed which minimize cd. The OA BCSID solves the CMP with interrelated demands to optimality. The OA aBBCSID solves the CMP when the values of de θ_1, θ_2,m and M are known; however, this OA is not optimal. In Chapter 7 the CMP is solved, knowing m and M and minimizing cd (OA MRBD). For the interrelated demands, a heuristic OA (HMRID) and a cd-minimizing OA (MRID) is presented. HMRID is good compromise between the numerical performance and the minimization of cd. The thesis concludes with a short discussion about shortcomings of the considered OPs and the created OAs. Then some remarks about future research possibilities in this field are given
34
Berg, Karin. "Online support and domestic violence : negotiating discourses, emotions, and actions". Thesis, London Metropolitan University, 2015. http://repository.londonmet.ac.uk/1198/.
Abstract (sommario):
This thesis makes an original contribution to the study of online support on domestic violence (often referred to as online support communities/groups) through a discursive feminist perspective. Whilst the few previous studies on the topic are limited in scope, this is the first to adopt a mixed methods approach, exploring the topic through three sets of data from one online support forum on domestic violence: qualitative textual analysis of threads (n=215); an online survey (n=70); and two interviews with the manager of the forum and the moderator. The thesis aims to explore the role of an online support forum for women in the process of ending violence in their lives. Six aspects of online support are explored: forum-host’s goals, history and development of the forum; the experience of online support from the perspective of its members; exploring the themes and topics dealt with in the forum; how forum users perceive the impact and relevance of these themes; how members construct emotions, violence, victims and perpetrators in written postings; and how members use violence discourse in support processes. The analysis of these aspects provides a new body of evidence regarding the possibilities of online support groups. First, interviews with the forum hosts give a unique insight to the challenges with hosting the forum, pursuing moderation, and the limits and possibilities with using a public anonymous space. Second, through the survey, a sample of forum-members describes an eclectic form of mutual support, the experience of moderator’s work, and the interaction with other members. The forum's impact on participants’ understanding of violence, help-seeking and decision-making is measured. Third, the analysis of threads demonstrates in-depth members’ reflexive work (Giddens, 1991) in the forum, which comprehends the whole processes of ending violence, and shows how members use violence discourse to understand violence, manage emotions and encourage specific choices and actions. A discursive theoretical perspective explicates how support processes are enacted within and according to a normative practice. The findings suggest previously overlooked issues, in particular with regard to flexible long-term support for women with experiences of domestic violence (Kelly et al, 2014).
35
Otani, Shuho. "The Problems Faced by China in Devising an Online Landscapewith Chinese Characteristics". Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1128721263.
36
Zhang, Yiding. "Exploring Problems in Water and Health by Text Mining of Online Information". The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561976152513536.
37
Parkhomenko, O. Ya, e O. V. Babenko. "For and against online and blended learning". Thesis, "Видавництво Людмила", 2021. https://er.knutd.edu.ua/handle/123456789/18986.
Abstract (sommario):
Online learning is one of the biggest trends in the education around the world. Three years ago no one could even imagine that we can study from your home. Online learning is a great alternative to traditional universities because a lot of people live far away from their universities.
38
Mahajan, Rutvij Sanjay. "Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems". Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/96725.
Abstract (sommario):
The k–server problem is of significant importance to the theoretical computer science and the operations research community. In this problem, we are given k servers, their initial locations and a sequence of n requests that arrive one at a time. All these locations are points from some metric space and the cost of serving a request is given by the distance between the location of the request and the current location of the server selected to process the request. We must immediately process the request by moving a server to the request location. The objective in this problem is to minimize the total distance traveled by the servers to process all the requests.
In this thesis, we present an empirical analysis of a new online algorithm for k-server problem. This algorithm maintains two solutions, online solution, and an approximately optimal offline solution. When a request arrives we update the offline solution and use this update to inform the online assignment. This algorithm is motivated by the Robust-Matching Algorithm [RMAlgorithm, Raghvendra, APPROX 2016] for the closely related online bipartite matching problem. We then give a comprehensive experimental analysis of this algorithm and also provide a graphical user interface which can be used to visualize execution instances of the algorithm. We also consider these problems under stochastic setting and implement a lookahead strategy on top of the new online algorithm.MS
39
Otani, Shuho. "The problems faced by China in devising an online landscape with Chinese characteristics". Ohio : Ohio University, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1128721263.
40
Vu, Dong Quan. "Models and solutions of strategic resource allocation problems : approximate equilibrium and online learning in Blotto games". Electronic Thesis or Diss., Sorbonne université, 2020. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2020SORUS120.pdf.
Abstract (sommario):
Les problèmes d'allocation des ressources sont définis comme les situations concernant les décisions sur la distribution d’un budget limité afin d’optimiser un objectif. Beaucoup d'entre eux impliquent des interactions entre des décideurs compétitifs ; ils peuvent être bien capturés par des modèles de théorie des jeux. Dans cette thèse, nous choisissons d'étudier les jeux d'allocation de ressources. Nous nous concentrons principalement sur le jeu de Colonel Blotto (CB). Dans le jeu CB, deux joueurs compétitifs, chacun ayant un budget fixe, distribuent simultanément leurs ressources vers n champs de bataille. Chaque joueur évalue chaque champ de bataille avec une certaine valeur. Dans chaque champ de bataille, le joueur qui a l'allocation la plus élevée gagne la valeur correspondante tandis que l'autre obtient zéro. Le gain de chaque joueur est à ses gains cumulés sur tous les champs de bataille. Tout d'abord, nous modélisons plusieurs variantes et extensions du jeu CB comme jeux d'informations complètes à un coup. Notre première contribution est une classe d'équilibres approximatifs dans ces jeux et nous prouvons que l'erreur d'approximation est bien contrôlée. Deuxièmement, nous modélisons les jeux d'allocation de ressources avec des structures combinatoires comme des problèmes d'apprentissage en ligne pour étudier des situations impliquant des jeux séquentiels et des informations incomplètes. Nous établissons une connexion entre ces jeux et les problèmes de chemin le plus court en ligne (OSP). Notre deuxième contribution est un ensemble de nouveaux algorithmes d’OSP sous plusieurs paramètres de feedback qui améliorent des garanties de regret et du temps d'exécutionResource allocation problems are broadly defined as situations involving decisions on distributing a limited budget of resources in order to optimize an objective. In particular, many of them involve interactions between competitive decision-makers which can be well captured by game-theoretic models. In this thesis, we choose to investigate resource allocation games. We primarily focus on the Colonel Blotto game (CB game). In the CB game, two competitive players, each having a fixed budget of resources, simultaneously distribute their resources toward n battlefields. Each player evaluates each battlefield with a certain value. In each battlefield, the player who has the higher allocation wins and gains the corresponding value while the other loses and gains zero. Each player's payoff is her aggregate gains from all the battlefields. First, we model several prominent variants of the CB game and their extensions as one-shot complete-information games and analyze players' strategic behaviors. Our first main contribution is a class of approximate (Nash) equilibria in these games for which we prove that the approximation error can be well-controlled. Second, we model resource allocation games with combinatorial structures as online learning problems to study situations involving sequential plays and incomplete information. We make a connection between these games and online shortest path problems (OSP). Our second main contribution is a set of novel regret-minimization algorithms for generic instances of OSP under several restricted feedback settings that provide significant improvements in regret guarantees and running time in comparison with existing solutions
41
Ahmad, Iftikhar [Verfasser], e Günter [Akademischer Betreuer] Schmidt. "Analysis of algorithms for online uni-directional conversion problems / Iftikhar Ahmad. Betreuer: Günter Schmidt". Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2013. http://d-nb.info/1053679491/34.
42
Cremers, Maria L. A. G. "Dynamic and stochastic planing problems with online decision making a novel class of models /". Groningen : [Groningen : University of Groningen ; University Library of Groningen] [Host], 2009. http://irs.ub.rug.nl/ppn/317.
43
Dong, Changhao, e Jinaan Toaha. "Identifying and analysing the problems and difficulties in online buying process from the perspectives of Swedish E-customers". Thesis, Mälardalens högskola, Akademin för ekonomi, samhälle och teknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-24414.
44
Lerotholi, Lelingoana Benedict. "The role of online communication on social development in Maseru (Lesotho)". Thesis, University of Zululand, 2012. http://hdl.handle.net/10530/1343.
Abstract (sommario):
A thesis submitted in fulfilment of the requirements for the degree of Masters in Communication Science at the University of Zululand, South Africa, 2012.Majority of developing societies are usually succumbing to numerous socio-economic challenges. Communities in Maseru, the capital of Lesotho, are not excluded from this trend. Online collaborations are consequently at the heart of addressing these challenges. This study examines the probability of encouraging and engaging online communication for social and economic development in Maseru. The promises of online communication for transforming society and advancing the new economy have rested on the arguments that online communication could expand and widen access to electronic commerce, enhance the quality of distance education, improve the general quality and standard of living , and eventually improve the economy of Maseru. Information Communication Technologies (ICTs) are very powerful tools for diffusing knowledge and information to society which is a fundamental aspect of the development process. The presence of new communication technologies has a greater influence on human lives than we ever thought. It is imperative that every community in Lesotho examines ways and means of adopting their information communication technology (ICT) infrastructure as soon as possible or face the possibility of social and economic stagnation and isolation. The Internet has ushered in innovative ways of socialising and conducting business. Although it has, through the process of globalization, created a wide space to engage in business and eradicate poverty, many societies are still isolated. There are many reasons for this which could range from voluntary isolation, inadequate infrastructure, ignorance or sheer laziness. The study was conducted within the paradigm of both qualitative and quantitative methods. Stratified and simple random sampling techniques were used and this allowed the researcher to divide the population of Maseru into various Strata. This research explored why Maseru is slow to adopt ICTs to enhance their economic and social development. Revelations from the study will benefit this community and will also assist in making recommendations for overcoming economic and social decline.
45
Rosenberg, Erik. "The relationship between online gambling, psychosocial problems and crime for help-seekers calling a helpline". Thesis, Malmö universitet, Fakulteten för hälsa och samhälle (HS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-24958.
Abstract (sommario):
Problem gambling is a public health issue that affects gamblers, relatives and society in general. The Swedish National Gambling Helpline, Stödlinjen, operates as a primary help to people with problems related to gambling. The 22,260 calls made to the helpline from 2009 to 2016 were studied with regards to gender, age, online gambling, psychosocial problems, and crime. Comparison between gamblers and relatives revealed gender and age differences. Reports of online gambling increased for both groups as time progressed, while crime declined. The results are discussed, and it is concluded that more research on the connection between gambling and crime is needed, as well as further develop a crime-aspect in the counsellors’ documentation of helpline callers.
46
Schubertsson, Larsson Lisette, e Donia Tarokh. "Kan modeföretag förbättra shoppingupplevelsen i sina onlinebutiker?" Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-12799.
Abstract (sommario):
In this paper we have chosen to study three aspects of the shopping experience online -navigation, product image and product information based on Hasan’s (2016) theory, to examine if, and how, the shopping experience online needs to improve in the fashion retail industry. From eyetracking-observations and qualitative interviews in this study, we identified the customers expectations and perceived problems in the online shoppingexperience. One of our findings show that there is a general agreement that product images have a significant impact on the shopping experience online. Another finding shows that distinctively visible filtering options on the online stores are important for the consumer to find what they are looking for.För denna uppsats har vi valt att studera kring tre aspekter inom shoppingupplevelsen online -navigering, produktbild och produktbeskrivning, utifrån Hasans (2016) grundmodell för att undersöka om och hur shoppingupplevelsen online behöver förbättras inom modebranschen. Utifrån eyetracking-observationer och kvalitativa intervjuer framkommer vilka förväntningar och upplevda problem som identifieras av konsumenter, för shoppingupplevelsen online. Ett av resultaten visar att det överlag finns en generell överenskommelse för att bland annat produktbilder har en stor inverkan på shoppingupplevelsen online. Ytterligare ett resultat visade att en tydlig presentation av filtreringsmöjligheter på webbshoppar är av betydelse för att konsumenten ska hitta rätt i sin sökning.
47
Celik, Melih. "Resource allocation problems under uncertainty in humanitarian supply chains". Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52302.
Abstract (sommario):
With the increasing effect of disasters and long term issues on human well-being and economy over the recent years, effective management of humanitarian supply chains has become more important. This thesis work focuses on three problems in humanitarian supply chains where uncertainty is inherent, namely (i) post-disaster debris clearance with uncertain debris amounts, (ii) allocation of a health/humanitarian commodity in a developing country setting with multiple demand types, and (iii) distribution of specialized nutritious foods by a large scale humanitarian organization. In each of the three parts, the problem is formally defined, and a novel optimal solution approach incorporating the inherent uncertainty in the environment and updates is proposed. In cases where optimal models cannot be solved within reasonable time, novel heuristics are developed. Through structural analysis and computational experiments based on real data, the proposed approaches are compared to those that ignore the uncertainty in the environment and/or updates of information as new data becomes available. Using computational experiments, the proposed approaches are compared to those that are applied in practice, and the aspects of the system where performance improvements are more significant are analyzed.
48
Velásquez, Flores Jorge Rafael. "Hierarchical multi-criteria operating theatre scheduling solving the tactical, operational and online planning problems with mathematical programming". Tönning Lübeck Marburg Der Andere Verl, 2008. http://d-nb.info/995846022/04.
49
Gatto, Michael Joseph. "On the impact of uncertainty on some optimization problems : combinatorial aspects of delay management and robust online scheduling /". Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17452.
50
Winkler, Melanie [Verfasser]. "Algorithms for online buffering problems and applications to the power control of a hybrid electric vehicle / Melanie Winkler". Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2014. http://d-nb.info/1051510023/34.