Conecte-se

Bibliografias temáticas / Competitive algorithms / Teses / dissertações

Siga este link para ver outros tipos de publicações sobre o tema: Competitive algorithms.

Teses / dissertações sobre o tema "Competitive algorithms"

Autor: Grafiati

Publicado: 25 de maio de 2024

Última modificação: 31 de julho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Competitive algorithms".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

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 da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

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 da fonte

Resumo:

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 =

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

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 da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

McNeill, Dean K. "Adaptive visual representations for autonomous mobile robots using competitive learning algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ35045.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Zhang, Kening. "A COMPETITIVE RECONFIGURATION APPROACH TO AUTONOMOUS FAULT HANDLING USING GENETIC ALGORITHMS." Doctoral diss., University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2319.

Texto completo da fonte

Resumo:

In this dissertation, a novel self-repair approach based on Consensus Based Evaluation (CBE) for autonomous repair of SRAM-based Field Programmable Gate Arrays (FPGAs) is developed, evaluated, and refined. An initial population of functionally identical (same input-output behavior), yet physically distinct (alternative design or place-and-route realization) FPGA configurations is produced at design time. During run-time, the CBE approach ranks these alternative configurations after evaluating their discrepancy relative to the consensus formed by the population. Through runtime competition, fau

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Premkumar, Aravind Preshant. "Competitive Algorithms and System for Multi-Robot Exploration of Unknown Environments." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/78847.

Texto completo da fonte

Resumo:

We present an algorithm to explore an orthogonal polygon using a team of p robots. This algorithm combines ideas from information-theoretic exploration algorithms and computational geometry based exploration algorithms. The algorithm is based on a single-robot polygon exploration algorithm and a tree exploration algorithm. We show that the exploration time of our algorithm is competitive (as a function of p) with respect to the offline optimal exploration algorithm. We discuss how this strategy can be adapted to real-world settings to deal with noisy sensors. In addition to theoretical analysi

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Lorenz, Julian Michael. "Optimal trading algorithms : portfolio transactions, multiperiod portfolio selection, and competitive online search /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17746.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

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 da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Tsai, Carol Leanne. "Heuristic Algorithms for Agnostically Identifying the Globally Stable and Competitive Metastable Morphologies of Block Copolymer Melts." Thesis, University of California, Santa Barbara, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=13423067.

Texto completo da fonte

Resumo:

<p> Block copolymers are composed of chemically distinct polymer chains that can be covalently linked in a variety of sequences and architectures. They are ubiquitous as ingredients of consumer products and also have applications in advanced plastics, drug delivery, advanced membranes, and next generation nano-lithographic patterning. The wide spectrum of possible block copolymer applications is a consequence of block copolymer self-assembly into periodic, meso-scale morphologies as a function of varying block composition and architecture in both melt and solution states, and the broad spectru

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Nayyar, Krati. "Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/86518.

Texto completo da fonte

Resumo:

In various business and military settings, there is an expectation of on-demand delivery of supplies and services. Typically, several delivery vehicles (also called servers) carry these supplies. Requests arrive one at a time and when a request arrives, a server is assigned to this request at a cost that is proportional to the distance between the server and the request. Bad assignments will not only lead to larger costs but will also create bottlenecks by increasing delivery time. There is, therefore, a need to design decision-making algorithms that produce cost-effective assignments of serve

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Dogeas, Konstantinos. "Energy Minimization, Data Movement and Uncertainty : Models and Algorithms." Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS070.pdf.

Texto completo da fonte

Resumo:

Les plateformes de calcul haute performance (HPC) sont la solution idéale pour exécuter des applications exigeantes en termes de calcul. Étant donné leur consommation importante en énergie, le besoin d'algorithmes plus efficaces en termes d'énergie est indispensable. De meilleurs algorithmes d'ordonnancement peuvent être conçus en exploitant les caractéristiques essentielles d'une plateforme HPC, telles que sa topologie de réseau et l'hétérogénéité de ses machines. On peut également obtenir de meilleures performances en concevant des modèles plus réalistes, qui saisissent les fonctionnalités d

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Gaspar, Cristian. "Variations on the Theme of Caching." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1048.

Texto completo da fonte

Resumo:

This thesis is concerned with caching algorithms. We investigate three variations of the caching problem: web caching in the Torng framework, relative competitiveness and caching with request reordering. <br /><br /> In the first variation we define different cost models involving page sizes and page costs. We also present the Torng cost framework introduced by Torng in [29]. Next we analyze the competitive ratio of online deterministic marking algorithms in the BIT cost model combined with the Torng framework. We show that given some specific restrictions on the set of possible re

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Meißner, Julie [Verfasser], Nicole [Akademischer Betreuer] Megow, Martin [Akademischer Betreuer] Skutella, Nicole [Gutachter] Megow, Martin [Gutachter] Skutella, and Leen [Gutachter] Stougie. "Uncertainty exploration : algorithms, competitive analysis, and computational experiments / Julie Meißner ; Gutachter: Nicole Megow, Martin Skutella, Leen Stougie ; Nicole Megow, Martin Skutella." Berlin : Technische Universität Berlin, 2018. http://d-nb.info/1166752348/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Verma, Poonam Santosh. "Non-equilibrium surface growth for competitive growth models and applications to conservative parallel discrete event simulations." Diss., Mississippi State : Mississippi State University, 2007. http://library.msstate.edu/etd/show.asp?etd=etd-11092007-141815.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Negoescu, Andrei [Verfasser], Ulrich [Akademischer Betreuer] Meyer, Georg [Akademischer Betreuer] Schnitger, and Alejandro [Akademischer Betreuer] López-Ortiz. "Design of competitive paging algorithms with good behaviour in practice / Andrei Negoescu. Gutachter: Ulrich Meyer ; Georg Schnitger ; Alejandro López-Ortiz. Betreuer: Ulrich Meyer." Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2013. http://d-nb.info/1044094524/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Negoescu, Andrei Laurian [Verfasser], Ulrich [Akademischer Betreuer] Meyer, Georg [Akademischer Betreuer] Schnitger, and Alejandro [Akademischer Betreuer] López-Ortiz. "Design of competitive paging algorithms with good behaviour in practice / Andrei Negoescu. Gutachter: Ulrich Meyer ; Georg Schnitger ; Alejandro López-Ortiz. Betreuer: Ulrich Meyer." Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2013. http://nbn-resolving.de/urn:nbn:de:hebis:30:3-321283.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Mattos, CÃsar Lincoln Cavalcante. "ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias." Universidade Federal do CearÃ, 2011. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7034.

Texto completo da fonte

Resumo:

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior<br>O paradigma de classificaÃÃo baseada em comitÃs tem recebido considerÃvel atenÃÃo na literatura cientÃfica em anos recentes. Neste contexto, redes neurais supervisionadas tÃm sido a escolha mais comum para compor os classificadores base dos comitÃs. Esta dissertaÃÃo tem a intenÃÃo de projetar e avaliar comitÃs de classificadores obtidos atravÃs de modificaÃÃes impostas a algoritmos de aprendizado nÃo-supervisionado, tais como as redes Fuzzy ART e SOM, dando origem, respectivamente, Ãs arquiteturas ARTIE (ART in Ensembles) e MUSCLE

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

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

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Alinia, Bahram. "Optimal resource allocation strategies for electric vehicles in smart grids." Thesis, Evry, Institut national des télécommunications, 2018. http://www.theses.fr/2018TELE0012/document.

Texto completo da fonte

Resumo:

Avec les préoccupations environnementales croissantes liées aux émissions de carbone et la chute rapide des prix des batteries, la part de marché des véhicules électriques (EV) augmente rapidement. Le nombre croissant de EV ainsi que les progrès sans précédent dans la capacité de la batterie et de la technologie entraîne une augmentation drastique de la demande totale d'énergie destinée aux véhicules électriques. Cette forte demande de charge rend complexe le problème de planification de la charge. Même en prenant avantage de la propriété reportable des demandes de charge et d'une planificatio

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

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 da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Alinia, Bahram. "Optimal resource allocation strategies for electric vehicles in smart grids." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2018. http://www.theses.fr/2018TELE0012.

Texto completo da fonte

Resumo:

Avec les préoccupations environnementales croissantes liées aux émissions de carbone et la chute rapide des prix des batteries, la part de marché des véhicules électriques (EV) augmente rapidement. Le nombre croissant de EV ainsi que les progrès sans précédent dans la capacité de la batterie et de la technologie entraîne une augmentation drastique de la demande totale d'énergie destinée aux véhicules électriques. Cette forte demande de charge rend complexe le problème de planification de la charge. Même en prenant avantage de la propriété reportable des demandes de charge et d'une planificatio

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Adelsson, Rodi. "Prisalgoritmer – ett instrument för konkurrensbegränsande samverkan : En studie om hur användningen av algoritmer påverkar förståelsen för olika samverkansformer och tillämpningen av artikel 101(1) FEUF." Thesis, Uppsala universitet, Juridiska institutionen, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-393254.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Raizonville, Adrien. "Regulation and competition policy of the digital economy : essays in industrial organization." Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT028.

Texto completo da fonte

Resumo:

Cette thèse aborde deux enjeux auxquels les régulateurs doivent faire face dans l’économie numérique : le défi informationnel généré par l'utilisation de nouvelles technologies d'intelligence artificielle et la problématique du pouvoir de marché des grandes plateformes numériques. Le premier chapitre de cette thèse étudie la mise en place d’un système d’audit (coûteux et imparfait) par un régulateur cherchant à réduire le risque de dommage généré par les technologies d’intelligence artificielle, tout en limitant le coût de la régulation. Les entreprises peuvent investir dans l'explicabilité de

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Sarafraz, Yazdi Zahra. "REAL-TIME CLASSIFIER BASED ON ADAPTIVE COMPETITIVE SELF-ORGANIZING ALGORITHM." OpenSIUC, 2016. https://opensiuc.lib.siu.edu/dissertations/1284.

Texto completo da fonte

Resumo:

This research proposes a novel Adaptive Competitive Self-organizing model, shortly named ACS, with applicability for real-time clustering and vector quantization. The model is designed based on sets of Ordinary Differential Equations (ODE’s) and free of any external controls. These properties make it suitable for hardware implementation and real-time applications. This classifier considers as unsupervised Neural Network (NN) since it doesn’t have any prior knowledge on input pattern’s classes. The design of this classifier is based on developing an energy function, constructed based on the sum

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Scquizzato, Michele. "Paging on Complex Architectures." Doctoral thesis, Università degli studi di Padova, 2013. http://hdl.handle.net/11577/3423133.

Texto completo da fonte

Resumo:

Advances in technology allow to build computer systems of ever increasing performances and capabilities. However, the effective use of such computational resources is often made difficult by the complexity of the system itself. Crucial to the performance of a computing device is the orchestration of the flow of data across the memory hierarchy. Specifically, given a fast but small memory (a cache) through which all the data that have to be processed must pass, it is necessary to establish a set of rules, then implemented by an algorithm, that define which data has to be evicted from such a mem

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Balavoine, Aurèle. "Implementation of the locally competitive algorithm on a field programmable analog array." Thesis, Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/37255.

Texto completo da fonte

Resumo:

Sparse approximation is an important class of optimization problem in signal and image processing applications. This thesis presents an analog solution to this problem, based on the Locally Competitive Algorithm (LCA). A Hopfield-Network-like analog system, operating on sub-threshold currents is proposed as a solution. The results of the circuit components' implementation on the RASP2.8a chip, a Field Programmable Analog Array, are presented.

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Shahrazad, Mohammad. "Optimal allocation of FACTS devices in power networks using imperialist competitive algorithm (ICA)." Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/11445.

Texto completo da fonte

Resumo:

Due to the high energy consumption demand and restrictions in the installation of new transmission lines, using Flexible AC Transmission System (FACTS) devices is inevitable. In power system analysis, transferring high-quality power is essential. In fact, one of the important factors that has a special role in terms of efficiency and operation is maximum power transfer capability. FACTS devices are used for controlling the voltage, stability, power flow and security of transmission lines. However, it is necessary to find the optimal location for these devices in power networks. Many optimizati

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Wang, Xinchang. "Revenue management with customer choice and sellers competition." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53876.

Texto completo da fonte

Resumo:

We build a variety of customer booking choice models for a major airline that operates in a very competitive origin-destination market. Some of the models are aimed at incorporating unobserved heterogeneous customer preferences for different departure times. The estimation results show that including these factors into choice models dramatically affects price sensitivity estimates, and therefore matters. We present a stochastic trust region algorithm for estimating ML-type models that involve high-dimensional integrals. The algorithm embeds two sampling processes: (i) a data sampling process a

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Luo, Lingzhi. "Distributed Algorithm Design for Constrained Multi-robot Task Assignment." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/426.

Texto completo da fonte

Resumo:

The task assignment problem is one of the fundamental combinatorial optimization problems. It has been extensively studied in operation research, management science, computer science and robotics. Task assignment problems arise in various applications of multi-robot systems (MRS), such as environmental monitoring, disaster response, extraterrestrial exploration, sensing data collection and collaborative autonomous manufacturing. In these MRS applications, there are realistic constraints on robots and tasks that must be taken into account both from the modeling perspective and the algorithmic p

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Navarro, Marco Vin?cius Monteiro. "Emprego de redes neurais artificiais supervisionadas e n?o supervisionadas no estudo de par?metros reol?gicos de excipientes farmac?uticos s?lidos." Universidade Federal do Rio Grande do Norte, 2014. http://repositorio.ufrn.br:8080/jspui/handle/123456789/13866.

Texto completo da fonte

Resumo:

Made available in DSpace on 2014-12-17T14:25:22Z (GMT). No. of bitstreams: 1 MarcoVMN_TESE.pdf: 3982733 bytes, checksum: 381ae79721c75a30e3373fe4487512c7 (MD5) Previous issue date: 2014-02-05<br>In this paper artificial neural network (ANN) based on supervised and unsupervised algorithms were investigated for use in the study of rheological parameters of solid pharmaceutical excipients, in order to develop computational tools for manufacturing solid dosage forms. Among four supervised neural networks investigated, the best learning performance was achieved by a feedfoward multilayer perceptr

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Wordsworth, John. "Winnerless competition in neural dynamics : cluster synchronisation of coupled oscillators." Thesis, University of Exeter, 2009. http://hdl.handle.net/10036/87314.

Texto completo da fonte

Resumo:

Systems of globally coupled phase oscillators can have robust attractors that are heteroclinic networks. Such a heteroclinic network is generated, where the phases cluster into three groups, within a specific regime of parameters when the phase oscillators are globally coupled using the function $g(\varphi) = -\sin(\varphi + \alpha) + r \sin(2\varphi + \beta)$. The resulting network switches between 30 partially synchronised states for a system of $N=5$ oscillators. Considering the states that are visited and the time spent at those states a spatio-temporal code can be generated for a given na

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Bergé, Pierre. "Algorithmes pour voyager sur un graphe contenant des blocages." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS480.

Texto completo da fonte

Resumo:

Nous étudions des problèmes NP-difficiles portant sur les graphes contenant des blocages.Nous traitons les problèmes de coupes du point de vue de la complexité paramétrée. La taille p de la coupe est le paramètre. Étant donné un ensemble de sources {s1,...,sk} et une cible t, nous proposons un algorithme qui construit une coupe de taille au plus p séparant au moins r sources de t. Nous nommons ce problème NP-complet Partial One-Target Cut. Notre algorithme est FPT. Nous prouvons également que la variante de Partial One-Target Cut, où la coupe est composée de noeuds, est W[1]-difficile. Notre s

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Raczynski, Christopher Michael. "A methodology for comprehensive strategic planning and program prioritization." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24622.

Texto completo da fonte

Resumo:

Thesis (Ph.D.)--Aerospace Engineering, Georgia Institute of Technology, 2008.<br>Committee Chair: Mavris, Dimitri; Committee Member: Bishop, Carlee; Committee Member: Costello, Mark; Committee Member: Kirby, Michelle; Committee Member: Schrage, Daniel

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Krämer, Jan. "Service bundling and quality competition on converging communications markets A game-theoretic analysis = Calibration of new flavor tagging algorithms using Bs oscillations /." [S.l. : s.n.], 2007. http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007394.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

VIALA, JEAN-RENAUD. "Apprentissage de reseaux de neurones en couches par la regle de retropropagation du gradient : developpement d'un algorithme competitif pour la compression et la segmentation d'images." Paris 6, 1990. http://www.theses.fr/1990PA066802.

Texto completo da fonte

Resumo:

Cette these aborde les differents aspects des reseaux de neurones en couches appeles perceptrons multicouches, depuis l'algorithme d'apprentissage, jusqu'a l'application a des problemes reels. La premiere partie est une etude parametrique de la regle d'apprentissage par retropropagation du gradient de l'erreur. Le gain et le temps de relaxation sont etudies lors de l'elaboration d'une loi d'echelle d'une fonction booleenne: la parite. Les architectures de reseau et les ensembles d'apprentissage sont analyses sur le probleme continu de la compression d'une image digitalisee. La deuxieme partie

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Mouton, Jeanne. "Trois essais en économie du droit." Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ0012.

Texto completo da fonte

Resumo:

Cette thèse se compose de trois essais qui s'inscrivent dans le cadre général du droit et de l'économie de la concurrence. Chaque essai répond à une question de recherche sous différents angles de l'économie du contentieux en étudiant les comportements unilatéraux d'un acteur dominant causant un dommage concurrentiel. Ce travail doctoral traite de la compensation, de la prévention et de la réparation de ce dommage et combine des méthodes issues de l'analyse des données, de l'économétrie et de la théorie des jeux. Le premier essai étudie les déterminants d'une action privée réussie à la suite d

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Repík, Tomáš. "Evoluční návrh využívající gramatickou evoluci." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363805.

Texto completo da fonte

Resumo:

p, li { white-space: pre-wrap; } Evoluce v přírodě slouží jako zdroj inspirace pro tuto práci . Základní myšlenkou je využití generativní síly gramatik v kombinaci s evolučním přístupem . Nabyté znalosti jsou aplikovány na hledání strategií chování v rozmanitých prostředích . Stromy chování jsou modelem , který bývá běžně použit na řízení rozhodování různých umělých inteligencí . Tato práce se zabývá hledáním stromů chování , které budou řídit jedince řešící nasledující dva problémy : upravenou verzi problému cesty koněm šachovnicí a hraní hry Pirátské kostky . Při hledání strategie hráče kost

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Shapero, Samuel Andre. "Configurable analog hardware for neuromorphic Bayesian inference and least-squares solutions." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/51719.

Texto completo da fonte

Resumo:

Sparse approximation is a Bayesian inference program with a wide number of signal processing applications, such as Compressed Sensing recovery used in medical imaging. Previous sparse coding implementations relied on digital algorithms whose power consumption and performance scale poorly with problem size, rendering them unsuitable for portable applications, and a bottleneck in high speed applications. A novel analog architecture, implementing the Locally Competitive Algorithm (LCA), was designed and programmed onto a Field Programmable Analog Arrays (FPAAs), using floating gate transistors to

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Afshar, Yaser. "Parallel distributed-memory particle methods for acquisition-rate segmentation and uncertainty quantifications of large fluorescence microscopy images." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-213157.

Texto completo da fonte

Resumo:

Modern fluorescence microscopy modalities, such as light-sheet microscopy, are capable of acquiring large three-dimensional images at high data rate. This creates a bottleneck in computational processing and analysis of the acquired images, as the rate of acquisition outpaces the speed of processing. Moreover, images can be so large that they do not fit the main memory of a single computer. Another issue is the information loss during image acquisition due to limitations of the optical imaging systems. Analysis of the acquired images may, therefore, find multiple solutions (or no solution) due

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Walter, Igor Alexandre. "Sistemas multiagentes em mercados de energia elétrica/." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260769.

Texto completo da fonte

Resumo:

Orientador: Fernando Antônio Campos Gomide<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-16T03:39:08Z (GMT). No. of bitstreams: 1 Walter_IgorAlexandre_D.pdf: 1762436 bytes, checksum: 257485271a6580f86b0b466799ceff14 (MD5) Previous issue date: 2010<br>Resumo: Sugerimos uma abordagem evolutiva para o projeto de estratégias de interação em sistemas multiagentes, especialmente estratégias de oferta modeladas como sistemas baseados em regras nebulosas. O objetivo é a aprendizagem das estratégias de

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Falade, Joannes Chiderlos. "Identification rapide d'empreintes digitales, robuste à la dissimulation d'identité." Thesis, Normandie, 2020. http://www.theses.fr/2020NORMC231.

Texto completo da fonte

Resumo:

La biométrie est de plus en plus utilisée à des fins d’identification compte tenu de la relation étroite entre la personne et son identifiant (comme une empreinte digitale). Nous positionnons cette thèse sur la problématique de l’identification d’individus à partir de ses empreintes digitales. L’empreinte digitale est une donnée biométrique largement utilisée pour son efficacité, sa simplicité et son coût d’acquisition modeste. Les algorithmes de comparaison d’empreintes digitales sont matures et permettent d’obtenir en moins de 500 ms un score de similarité entre un gabarit de référence (stoc

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Liang, Han-Wen, and 梁漢文. "Preclassified competitive-learning algorithms for vector quantization." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/59776420137974893958.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

"A probabilistic cooperative-competitive hierarchical search model." 1998. http://library.cuhk.edu.hk/record=b5889641.

Texto completo da fonte

Resumo:

by Wong Yin Bun, Terence.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.<br>Includes bibliographical references (leaves 99-104).<br>Abstract also in Chinese.<br>List of Figures --- p.ix<br>List of Tables --- p.xi<br>Chapter I --- Preliminary --- p.1<br>Chapter 1 --- Introduction --- p.2<br>Chapter 1.1 --- Thesis themes --- p.4<br>Chapter 1.1.1 --- Dynamical view of landscape --- p.4<br>Chapter 1.1.2 --- Bottom-up self-feedback algorithm with memory --- p.4<br>Chapter 1.1.3 --- Cooperation and competition --- p.5<br>Chapter 1.1.4 --- Contributions to genetic algorithms ---

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Kuo, Cheng-Ming, and 郭政銘. "Competitive Analysis of Dynamic Dictionaries and Disk Scheduling Algorithms." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/33985293047201216252.

Texto completo da fonte

Resumo:

碩士<br>國立臺灣大學<br>電機工程學研究所<br>88<br>In this thesis, we study two on-line problems. The first one is the on-line dictionary problem. An implementation of dynamic dictionaries based on binomial trees is provided. The move-to-front heuristic is proven to be 3-competitive for the tree update problem on our implementation. We also prove that the lower bound for on-line algorithms on this implementation is (2k+2)/(k+2), where k is the order of the tree. By the comparison of dictionaries on the list, the splay tree, and the our model, a dictionary based on the binomial

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Chen, Wen-Hsien, and 陳文憲. "Improved Imperialist Competitive Algorithms for Compensatory Neural Fuzzy Systems." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/6ena88.

Texto completo da fonte

Resumo:

碩士<br>國立虎尾科技大學<br>電機工程研究所<br>102<br>This dissertation proposes improve imperialist competitive algorithms (IICA) for compensatory neural fuzzy systems (CNFS) model. This study proposes IICA includes the bare-bone imperialistic competitive algorithm (BBICA) and united-based imperialistic competitive algorithm (UICA). This dissertation consists of the two major parts. In the first part, the proposed BBICA is to reduce parameter setting of original ICA. BBICA adopts Gaussian distribution to improve assimilation phase of ICA and prevent BBICA from falling into local optimal solution and boot the e

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Matos, Catarina Corrêa Mendes Correia de. "Algorithms: the end of traditional competitive markets? the case of partneo." Master's thesis, 2019. http://hdl.handle.net/10362/68140.

Texto completo da fonte

Resumo:

This thesis analyses how the development of machine learning and pricing algorithms is affecting competition between undertakings by facilitating collusive behaviours and how this issue should be addressed by competition authorities. Combining the insights given by the existent literature on the topic with the analyse of the recent case of Partneo, findings suggest that algorithms are indeed changing the competitive landscape. Although current EU law can deal with some cases, others fall out of its reach. The boundaries of competition law are strongly challenged on the case of Partneo in which

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Megow, Nicole, and Andreas S. Schulz. "Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms." 2004. http://hdl.handle.net/1721.1/4048.

Texto completo da fonte

Resumo:

We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios compared to the previously best-known deterministic on-line algorithms, which are (4+epsilon)-competitive in either case. Our preemptive algorithm is 2-competitive, which actually meets the competitive ratio of the currently best randomized on-line algorithm for this scenario. Our nonpreemptive alg

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Bender, Marco. "Randomized Approximation and Online Algorithms for Assignment Problems." Doctoral thesis, 2015. http://hdl.handle.net/11858/00-1735-0000-0022-6016-2.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Schäfer, Guido [Verfasser]. "Worst case instances are fragile : average case and smoothed competitive analysis of algorithms / Guido Schäfer." 2004. http://d-nb.info/972316930/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Bento, Pedro Miguel Rocha. "Hybrid artificial intelligence algorithms for short-term load and price forecasting in competitive electric markets." Master's thesis, 2017. http://hdl.handle.net/10400.6/7851.

Texto completo da fonte

Resumo:

The liberalization and deregulation of electric markets forced the various participants to accommodate several challenges, including: a considerable accumulation of new generation capacity from renewable sources (fundamentally wind energy), the unpredictability associated with these new forms of generation and new consumption patterns, contributing to further electricity prices volatility (e.g. the Iberian market). Given the competitive framework in which market participants operate, the existence of efficient computational forecasting techniques is a distinctive factor. Based on these foreca

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!