Log in

Relevant bibliographies by topics / Linear search / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Linear search.

Dissertations / Theses on the topic 'Linear search'

Author: Grafiati

Published: 25 May 2024

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Linear search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Rees, Leigh H. "Chirality : in search of organometallic second order non-linear optic materials." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hepburn, Ian David. "Development of linear InSb array instrumentation and the search for brown dwarfs." Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bothwell, Brian P. "An Iterative Linear Programming Approach to Solving Large Cumulative Search-Evasion Games." Thesis, Monterey, California. Naval Postgraduate School, 1990. http://hdl.handle.net/10945/30678.

Full text

Abstract:

Approved for public release, distribution is unlimited<br>Cumulative search-evasion games (CSEGs) involve two players, a searcher and an evader, who move among some finite set of cells. Neither player is aware of the other player's position during any stage of the game. When the payoff for the game is assumed to be the number of times the searcher and evader occupy the same cell, Eagle and Washburn proposed two solution techniques: one by fictitious play and the other by solving equivalent linear programming formulations. However, both have proved to be time consuming even for moderately sized

APA, Harvard, Vancouver, ISO, and other styles

4

Madabushi, Ananth R. "Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36833.

Full text

Abstract:

This research effort focuses on large-scale linear programming problems that arise in the context of solving various problems such as discrete linear or polynomial, and continuous nonlinear, nonconvex programming problems, using linearization and branch-and-cut algorithms for the discrete case, and using polyhedral outer-approximation methods for the continuous case. These problems arise in various applications in production planning, location-allocation, game theory, economics, and many engineering and systems design problems. During the solution process of discrete or continuous nonconvex pr

APA, Harvard, Vancouver, ISO, and other styles

5

Kim, Seongsu. "A BAYESIAN EVIDENCE DEFINING SEARCH." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429789001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Law, Glenn W. (Glenn Woodrow). "Measurements of ocular counterrolling during linear accelerations using an electromagnetic scleral search coil system." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/43236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Stokes, Klara. "Combinatorial structures for anonymous database search." Doctoral thesis, Universitat Rovira i Virgili, 2011. http://hdl.handle.net/10803/52799.

Full text

Abstract:

This thesis treats a protocol for anonymous database search (or if one prefer, a protocol for user-private information retrieval), that is based on the use of combinatorial configurations. The protocol is called P2P UPIR. It is proved that the (v,k,1)-balanced incomplete block designs (BIBD) and in particular the finite projective planes are optimal configurations for this protocol. The notion of n-anonymity is applied to the configurations for P2P UPIR protocol and the transversal designs are proved to be n-anonymous configurations for P2P UPIR, with respect to the neighborhood points of the

APA, Harvard, Vancouver, ISO, and other styles

8

Vasireddy, Jhansi Lakshmi. "Applications of Linear Algebra to Information Retrieval." Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/math_theses/71.

Full text

Abstract:

Some of the theory of nonnegative matrices is first presented. The Perron-Frobenius theorem is highlighted. Some of the important linear algebraic methods of information retrieval are surveyed. Latent Semantic Indexing (LSI), which uses the singular value de-composition is discussed. The Hyper-Text Induced Topic Search (HITS) algorithm is next considered; here the power method for finding dominant eigenvectors is employed. Through the use of a theorem by Sinkohrn and Knopp, a modified HITS method is developed. Lastly, the PageRank algorithm is discussed. Numerical examples and MATLAB programs

APA, Harvard, Vancouver, ISO, and other styles

9

Lopez, Soto Claudia Orquidea. "Formulation space search for two-dimensional packing problems." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7455.

Full text

Abstract:

The two-dimension packing problem is concerned with the arrangement of items without overlaps inside a container. In particular we have considered the case when the items are circular objects, some of the general examples that can be found in the industry are related with packing, storing and transportation of circular objects. Although there are several approaches we want to investigate the use of formulation space search. Formulation space search is a fairly recent method that provides an easy way to escape from local optima for non-linear problems allowing to achieve better results. Despite

APA, Harvard, Vancouver, ISO, and other styles

10

Lazic, Jasmina. "New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering." Thesis, Brunel University, 2010. http://bura.brunel.ac.uk/handle/2438/4602.

Full text

Abstract:

Many real-world optimisation problems are discrete in nature. Although recent rapid developments in computer technologies are steadily increasing the speed of computations, the size of an instance of a hard discrete optimisation problem solvable in prescribed time does not increase linearly with the computer speed. This calls for the development of new solution methodologies for solving larger instances in shorter time. Furthermore, large instances of discrete optimisation problems are normally impossible to solve to optimality within a reasonable computational time/space and can only be tackl

APA, Harvard, Vancouver, ISO, and other styles

11

Dimelow, David J. "Non-linear dynamics of an offshore mooring tower." Thesis, University of Aberdeen, 1997. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU092912.

Full text

Abstract:

Offshore mooring towers are one of a number of single-point mooring (SPM) systems which provide a berthing point for tankers, enabling the transfer of crude oil to or from the moored vessel. The periodic slackening of the mooring hawser between the vessel and the tower gives rise to a discontinuously non-linear restoring function. Hence, the wave-induced motions of the tower can be highly complex, with the possibility of large amplitude, and potentially hazardous motions. A large amount of work has been carried out in studying single-point mooring systems. However, much of this work has focuse

APA, Harvard, Vancouver, ISO, and other styles

12

Kevorkiants, Rouslan. "Linear scaling conjugate gradient density matrix search: implementation, validation, and application with semiempirical molecular orbital methods." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968547028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Rossmanith, Gregor. "Concepts of non-linear data analysis applied to the search of non-Gaussianities in the CMB." Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-138198.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

TORTI, FRANCESCA. "Advances in the forward search: methodological and applied contributions." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2010. http://hdl.handle.net/10281/7791.

Full text

Abstract:

The thesis is about the Forward Search, an approach to robust data analysis proposed and developed in the last 15 years mainly by Atkinson, Riani and Cerioli. It is a general method for detecting unidentified subsets and masked outliers in complex data and for determining their effect on models fitted to the data. This thesis approaches the Forward Search in the regression context under different perspectives, motivated by issues encountered in concrete application contexts related to the analysis of international trade data. The main contributions of the thesis can be summarised as

APA, Harvard, Vancouver, ISO, and other styles

15

Sands, William Alvah. "Phylogenetic Inference Using a Discrete-Integer Linear Programming Model." University of Akron / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Gardenghi, John Lenon Cardoso. "Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11072014-084756/.

Full text

Abstract:

Neste trabalho, propomos um método de pontos interiores para minimização com restrições lineares de grande porte. Este método explora a linearidade das restrições, partindo de um ponto viável e preservando a viabilidade dos iterandos. Apresentamos os principais resultados de convergência global, além de uma descrição rica em detalhes de uma implementação prática de todos os passos do método. Para atestar a implementação do método, exibimos uma ampla experimentação numérica, e uma análise comparativa com métodos bem difundidos na comunidade de otimização contínua.<br>In this work, we propose an

APA, Harvard, Vancouver, ISO, and other styles

17

Chhabra, Meenal. "Studies in the Algorithmic Pricing of Information Goods and Services." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/25874.

Full text

Abstract:

This thesis makes a contribution to the algorithmic pricing literature by proposing and analyzing techniques for automatically pricing digital and information goods in order to maximize profit in different settings. We also consider the effect on social welfare when agents use these pricing algorithms. The digital goods considered in this thesis are electronic commodities that have zero marginal cost and unlimited supply e.g., iTunes apps. On the other hand, an information good is an entity that bridges the knowledge gap about a product between the consumer and the seller when the consumer can

APA, Harvard, Vancouver, ISO, and other styles

18

Bustamante, Juan Pablo Mamani. "Influência local com procura \"forward\" em modelos de regressão linear." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/104/104131/tde-19012017-112532/.

Full text

Abstract:

A identificação de observações influentes e/ou aberrantes de um conjunto de dados é conhecida como uma parte das análises de diagnóstico. Esta técnica de diagnóstico têm como uma das finalidades verificar a robustez de um modelo estatístico, pois a não identificação dos dados influentes pode afetar a análise ou obter resultados incorretos. As metodologias comumente utilizadas para o diagnóstico de observações influentes em modelos de regressão são métodos de influência global (Belsey et al., 1980). Cook (1986) introduziu um método geral para avaliar a influência local de pequenas perturbações

APA, Harvard, Vancouver, ISO, and other styles

19

Nilsson, Olof. "Visualization of live search." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-102448.

Full text

Abstract:

The classical search engine result page is used for many interactions with search results. While these are effective at communicating relevance, they do not present the context well. By giving the user an overview in the form of a spatialized display, in a domain that has a physical analog that the user is familiar with, context should become pre-attentive and obvious to the user. A prototype has been built that takes public medical information articles and assigns these to parts of the human body. The articles are indexed and made searchable. A visualization presents the coverage of a query o

APA, Harvard, Vancouver, ISO, and other styles

20

Ng, Choon Hoe. "Sensorless vector control of rotary and linear permanent magnet synchronous machines operating at extreme conditions." Thesis, University of Aberdeen, 2003. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU166980.

Full text

Abstract:

Permanent magnet motors are known to provide higher torque and better efficiency than induction motors. They have found applications such as propulsion, motion control, traction, etc in industry. To reduce production costs by eliminating the use of position sensor, many sensorless drive schemes have emerged to fulfil this aim. Most of these sensorless algorithms utilise the back-EMF and magnetic saliency of PM motors to predict the rotor position, which is necessary for any closed loop vector controlled drive implementation. At zero or low speed operation, most sensorless schemes failed to per

APA, Harvard, Vancouver, ISO, and other styles

21

Haddow, Barry M. "A study of certain linear connections arising in physical theories with particular reference to holonomy." Thesis, University of Aberdeen, 1993. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU052682.

Full text

Abstract:

The aim of this thesis is to study certain linear connections arising in physics; and in particular metric connections, Weyl connections and Cartan connections are examined. Emphasis is placed on the holonomy group of the connection and the relationships between the relevant geometric objects in the physical theories. The appropriate mathematical background is reviewed in the first two chapters and various notions from differential geometry are introduced. Proofs of theorems relating covariantly constant and recurrent tensors with holonomy are given in detail, and Eisenhart's results on connec

APA, Harvard, Vancouver, ISO, and other styles

22

Rossmanith, Gregor [Verfasser], and Gregor [Akademischer Betreuer] Morfill. "Concepts of non-linear data analysis applied to the search of non-Gaussianities in the CMB / Gregor Rossmanith. Betreuer: Gregor Morfill." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2011. http://d-nb.info/1018847197/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Pakusa, Wied [Verfasser], Erich [Akademischer Betreuer] Grädel, Martin [Akademischer Betreuer] Otto, and Anuj [Akademischer Betreuer] Dawar. "Linear equation systems and the search for a logical characterisation of polynomial time / Wied Pakusa ; Erich Grädel, Martin Otto, Anuj Dawar." Aachen : Universitätsbibliothek der RWTH Aachen, 2015. http://d-nb.info/1125910623/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Pakusa, Wied [Verfasser], Erich Akademischer Betreuer] Grädel, Martin [Akademischer Betreuer] Otto, and Anuj [Akademischer Betreuer] [Dawar. "Linear equation systems and the search for a logical characterisation of polynomial time / Wied Pakusa ; Erich Grädel, Martin Otto, Anuj Dawar." Aachen : Universitätsbibliothek der RWTH Aachen, 2015. http://d-nb.info/1125910623/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pal, Anibrata. "Multi-objective optimization in learn to pre-compute evidence fusion to obtain high quality compressed web search indexes." Universidade Federal do Amazonas, 2016. http://tede.ufam.edu.br/handle/tede/5128.

Full text

Abstract:

Submitted by Sáboia Nágila (nagila.saboia01@gmail.com) on 2016-07-29T14:09:40Z No. of bitstreams: 1 Disertação-Anibrata Pal.pdf: 1139751 bytes, checksum: a29e1923e75e239365abac2dc74c7f40 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-08-15T17:54:46Z (GMT) No. of bitstreams: 1 Disertação-Anibrata Pal.pdf: 1139751 bytes, checksum: a29e1923e75e239365abac2dc74c7f40 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-08-15T17:57:29Z (GMT) No. of bitstreams: 1 Disert

APA, Harvard, Vancouver, ISO, and other styles

26

Melo, Everton Luiz de. "Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/.

Full text

Abstract:

O ambiente de produção abordado neste trabalho é o Job Shop Flexível (JSF), uma generalização do Job Shop (JS). O problema de programação de tarefas, ou jobs, no ambiente JS é classificado por Garey; Johnson e Sethi (1976) como NP-Difícil e o JSF é, no mínimo, tão difícil quanto o JS. O JSF é composto por um conjunto de jobs, cada qual constituído por operações. Cada operação deve ser processada individualmente, sem interrupção, em uma única máquina de um subconjunto de máquinas habilitadas. O principal critério de desempenho considerado é a minimização dos atrasos dos jobs. São apresentados m

APA, Harvard, Vancouver, ISO, and other styles

27

Liut, Daniel Armando. "Neural-Network and Fuzzy-Logic Learning and Control of Linear and Nonlinear Dynamic Systems." Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/29163.

Full text

Abstract:

The goal of this thesis is to develop nontraditional strategies to provide motion control for different engineering applications. We focus our attention on three topics: 1) roll reduction of ships in a seaway; 2) response reduction of buildings under seismic excitations; 3) new training strategies and neural-network configurations. The first topic of this research is based on a multidisciplinary simulation, which includes ship-motion simulation by means of a numerical model called LAMP, the modeling of fins and computation of the hydrodynamic forces produced by them, and a neural-network/fuz

APA, Harvard, Vancouver, ISO, and other styles

28

Jones, Eric K. "An investigation of the effectiveness of a linear video in informing Kutztown University students of job-search resources and strategies in a career placement office." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1995. http://www.kutztown.edu/library/services/remote_access.asp.

Full text

Abstract:

Thesis (M.S.)--Kutztown University of Pennsylvania, 1995.<br>Source: Masters Abstracts International, Volume: 45-06, page: 2711. Typescript. Abstract appears on leaves 2-3. Includes bibliographical references (leaves 65-67).

APA, Harvard, Vancouver, ISO, and other styles

29

Wang, Jiexin. "Policy Hyperparameter Exploration for Behavioral Learning of Smartphone Robots." 京都大学 (Kyoto University), 2017. http://hdl.handle.net/2433/225744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

O'Neal, Jerome W. "The use of preconditioned iterative linear solvers in interior-point methods and related topics." Diss., Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-06242005-162854/.

Full text

Abstract:

Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2006.<br>Parker, R. Gary, Committee Member ; Shapiro, Alexander, Committee Member ; Nemirovski, Arkadi, Committee Member ; Green, William, Committee Member ; Monteiro, Renato, Committee Chair.

APA, Harvard, Vancouver, ISO, and other styles

31

Rossini, Wagner Marques. "Identificação de parâmetros de motor de indução linear tubular para extração de petróleo." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/3/3139/tde-02062008-171921/.

Full text

Abstract:

O presente trabalho apresenta a identificação de parâmetros de motor de indução linear tubular para a extração de petróleo, denominado de MATÆOS -- Motor Assíncrono Tubular para Aplicação na Extração de Óleo Subterrâneo. O primeiro passo para a identificação de parâmetros do motor foi a implementação da bancada de testes com o seu sistema de controle e supervisório. O modelo adotado corresponde à situação de operação em regime estacionário e consiste no circuito contendo resistores e indutores tradicionalmente utilizado para representar motores de indução. A identificação dos parâmetros foi re

APA, Harvard, Vancouver, ISO, and other styles

32

Björklund, Henrik. "Combinatorial Optimization for Infinite Games on Graphs." Doctoral thesis, Uppsala University, Department of Information Technology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4751.

Full text

Abstract:

<p>Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc.</p><p>The infinite games on finite graphs we study in this thesis have their primary applications in verification, but are also of fundamental importance from the complexity-theoretic point of view. They include parity, mean payoff, and simple stochastic games.</p><p>We focus on solving graph games by using iterative stra

APA, Harvard, Vancouver, ISO, and other styles

33

Camargo, Fernando Taietti. "Estudo comparativo de passos espectrais e buscas lineares não monótonas." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-16062008-211538/.

Full text

Abstract:

O método do Gradiente Espectral, introduzido por Barzilai e Borwein e analisado por Raydan, para minimização irrestrita, é um método simples cujo desempenho é comparável ao de métodos tradicionais como, por exemplo, gradientes conjugados. Desde a introdução do método, assim como da sua extensão para minimização em conjuntos convexos, foram introduzidas várias combinações de passos espectrais diferentes, assim como de buscas lineares não monótonas diferentes. Dos resultados numéricos apresentados em vários trabalhos não é possível inferir se existem diferenças significativas no desempenho dos d

APA, Harvard, Vancouver, ISO, and other styles

34

Waters, Rafael. "Energy from Ocean Waves : Full Scale Experimental Verification of a Wave Energy Converter." Doctoral thesis, Uppsala universitet, Elektricitetslära, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9404.

Full text

Abstract:

A wave energy converter has been constructed and its function and operational characteristics have been thoroughly investigated and published. The wave energy converter was installed in March of 2006 approximately two kilometers off the Swedish west coast in the proximity of the town Lysekil. Since then the converter has been submerged at the research site for over two and a half years and in operation during three time periods for a total of 12 months, the latest being during five months of 2008. Throughout this time the generated electricity has been transmitted to shore and operational data

APA, Harvard, Vancouver, ISO, and other styles

35

Chen, Ting. "Energy-Efficient Resource Allocation in OFDMA Systems." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98683.

Full text

Abstract:

In this thesis, a resource allocation problem in OFDMA is studied for the energy efficiency of wireless network. The objective is to minimize the total energy consumption which includes transmission energy consumption, and circuit energy consumption at both transmitter and receiver with required per user’s rate constraint. For problem solution, a heuristic algorithm with low computational complexity and suboptimal solution is proposed, developed in two steps with an increasing order of complexity. Besides, a bounding scheme based on model linearization of formulated nonlinear system model is a

APA, Harvard, Vancouver, ISO, and other styles

36

Mazzieri, Diego. "Machine Learning for combinatorial optimization: the case of Vehicle Routing." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24688/.

Full text

Abstract:

The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial optimization problems in the Operations Research (OR) community. Its relevance is not only related to the various real-world applications it deals with, but to its inherent complexity being an NP-hard problem. From its original formulation more than 60 years ago, numerous mathematical models and algorithms have been proposed to solve VRP. The most recent trend is to leverage Machine Learning (ML) in conjunction with these traditional approaches to enhance their performance. In particular, this work investi

APA, Harvard, Vancouver, ISO, and other styles

37

Khorbatly, Mohamad. "Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMLH18/document.

Full text

Abstract:

Les travaux présentes dans cette thèse s'inscrivent dans le cadre des méthodes d'évacuation des populations. Ils visent à étudier les capacités et modéliser le problème d'évacuation (blessés, sinistrés, enfants, personnes agées, etc.) dans une situation de crise (attentats terroristes, catastrophes naturelles, etc.) et développer des méthodes d'aide à la décision tout en proposant une meilleure planification et des plans optimaux d'évacuation des populations de la zone de crise vers les centres hospitaliers.Notre travail consiste à résoudre le problème d'évacuation de blessés dans des zones de

APA, Harvard, Vancouver, ISO, and other styles

38

Cervelin, Bruno Henrique 1988. "Sobre um método de minimização irrestrita baseado em derivadas simplex." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306038.

Full text

Abstract:

Orientador: Maria Aparecida Diniz Ehrhardt<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica<br>Made available in DSpace on 2018-08-22T15:48:00Z (GMT). No. of bitstreams: 1 Cervelin_BrunoHenrique_M.pdf: 1935510 bytes, checksum: 91d17dd60bdd280c9eddd301cb3d2c24 (MD5) Previous issue date: 2013<br>Resumo: O objetivo deste trabalho é apresentar alguns métodos de minimização irrestrita sem derivadas, tais como, Nelder-Mead, busca padrão e SID-PSM, assim como compará-los. Ainda pretendemos apresentar o problema de otimização

APA, Harvard, Vancouver, ISO, and other styles

39

Silva, Maurício Rodrigues. "Um novo método híbrido aplicado à solução de sistemas não-lineares com raízes múltiplas." Universidade do Estado do Rio de Janeiro, 2009. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=1559.

Full text

Abstract:

Este trabalho tem como objetivo apresentar soluções de sistemas não-lineares com raízes múltiplas, através de um algoritmo híbrido. Para esta finalidade foi desenvolvido e implementado um algoritmo de busca aleatória baseado no método proposto por Luus e Jaakola (1973) como etapa de busca aleatória dos pontos iniciais, que são refinados através do algoritmo de Hooke e Jeeves. O diferencial deste trabalho foi propor um algoritmo híbrido, utilizando as características dos algoritmos Luus-Jaakola e Hooke e Jeeves como etapas de busca e refinamento respectivamente. Para isso, os algoritmos acima s

APA, Harvard, Vancouver, ISO, and other styles

40

Farias, Everton da Silveira. "A heuristic approach to supply chain network design in a multi-commodity four-echelon logistics system." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/140332.

Full text

Abstract:

Nesta tese propõe-se um método heurístico para o problema de Projeto de Rede da Cadeia de Suprimentos (Supply Chain Network Design) considerando vários aspectos de relevância prática, tais como: fornecedores e matérias-primas, localização e operação de instalações, atribuição de Centros de Distribuição (CD), e grande número de clientes e produtos. Uma eficiente abordagem heurística de duas fases é proposta para a obtenção de soluções viáveis para os problemas, que inicialmente é modelado como um Programa Linear Inteiro Misto (PLIM) de grande escala. Na fase de construção, uma estratégia de Lin

APA, Harvard, Vancouver, ISO, and other styles

41

Missio, Fabricio Jose. "Equilíbrio com desemprego em um contexto de preços e salários flexíveis : uma abordagem a partir de um modelo não-linear caracterizado como ciclo-limite /." oai:ufpr.br:235189, 2006. http://200.17.209.5:8000/cgi-bin/gw_42_13/chameleon.42.13a?host=localhost%201111%20DEFAULT&sessionid=VTLS&function=CARDSCR&search=KEYWORD&pos=1&u1=12101&t1=235189.

Full text

Abstract:

Orientador : Jose Luis da Costa Oreiro<br>Dissertação (mestrado) - Universidade Federal do Paraná, Setor de Ciências Sociais Aplicadas, Programa de Pós-Graduação em Desenvolvimento Econômico. Defesa: Curitiba, 2006<br>Inclui bibliografia<br>Área de concentração : Políticas públicas

APA, Harvard, Vancouver, ISO, and other styles

42

Le, roux Agnès. "Ordonnancement de rendez-vous en tête à tête." Thesis, Nantes, Ecole des Mines, 2014. http://www.theses.fr/2014EMNA0182/document.

Full text

Abstract:

Les problèmes d’ordonnancement de rendez-vous en tête-à-tête sont des problèmes dans lesquels des personnes souhaitent se rencontrer par deux lors de courts rendez-vous qui se déroulent lors d’une session unique. Dans cette thèse, nous référençons plusieurs applications de ce type de problèmes et proposons des notations qui généralisent les notations standards de problèmes d’ordonnancement α|β|γ. Nous nous intéressons en particulier à un cas dans lequel deux populations distinctes se rencontrent, des participants peuvent arriver en retard et des rencontres sont interdites. L’objectif est de mi

APA, Harvard, Vancouver, ISO, and other styles

43

May, Lauren Jeanette. "Design, analysis and implementation of symmetric block ciphers." Thesis, Queensland University of Technology, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Sehovic, Mirsad, and Markus Carlsson. "Nåbarhetstestning i en baneditor : En undersökning i hur nåbarhetstester kan implementeras i en baneditor samt funktionens potential i att ersätta manuell testning." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-36394.

Full text

Abstract:

Denna studie undersöker om det är möjligt att införa nåbarhetstestning i en baneditor. Testets syfte är att ersätta manuell testing, det vill säga att bankonstruktören inte ska behöva spela igenom banan för att säkerställa att denne kommer kunna nå alla nåbara positioner.För att kunna utföra studien skapas en enkel baneditor som testplattform. Vidare utförs en jämförande studie av flera alternativa algoritmer för att fastställa vilken som är mest passande för nåbarhetstestning i en baneditor.Resultatet från den jämförande studien visade att A* (A star) var den mest passande algoritmen för funk

APA, Harvard, Vancouver, ISO, and other styles

45

Nahangi, Arian A. "Modeling and Solving the Outsourcing Risk Management Problem in Multi-Echelon Supply Chains." DigitalCommons@CalPoly, 2021. https://digitalcommons.calpoly.edu/theses/2321.

Full text

Abstract:

Worldwide globalization has made supply chains more vulnerable to risk factors, increasing the associated costs of outsourcing goods. Outsourcing is highly beneficial for any company that values building upon its core competencies, but the emergence of the COVID-19 pandemic and other crises have exposed significant vulnerabilities within supply chains. These disruptions forced a shift in the production of goods from outsourcing to domestic methods. This paper considers a multi-echelon supply chain model with global and domestic raw material suppliers, manufacturing plants, warehouses, and mark

APA, Harvard, Vancouver, ISO, and other styles

46

Hellberg, Joakim, and Axel Sundkvist. "Comparing Control Strategies fora Satcom on the Move Antenna." Thesis, KTH, Skolan för industriell teknik och management (ITM), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-279331.

Full text

Abstract:

Satellite communication is a widely known method for communicating with remote or disaster-strickenplaces. Sometimes, thecommunication can be a matter of life and death,and it is thus vital that it works well. For two-way communication (such as internet) it is necessary for the antenna on Earth to point towards the satellite with a pointing error not larger than a few tenths of a degree. For example, regulations decided by the authorities in the U.S. forbid pointing errors larger than 0.5°. In some cases the antenna on Earth has to be moving while satellite communication is maintained. Such ca

APA, Harvard, Vancouver, ISO, and other styles

47

Nguyen, Tuan. "Adaptive visual tracking via multiple appearance models and multiple linear searches." Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/28565/.

Full text

Abstract:

This research is concerned with adaptive, probabilistic single target tracking algorithms. Though visual tracking methods have seen significant improvement, sustained ability to capture appearance changes and precisely locate the target during complex and unexpected motion remains an open problem. Three novel tracking mechanisms are proposed to address these challenges. The first is a Particle Filter based Markov Chain Monte Carlo method with sampled appearances (MCMC-SA). This adapts to changes in target appearance by combining two popular generative models: templates and histograms, maintain

APA, Harvard, Vancouver, ISO, and other styles

48

Oliveira, José Carlos Francisco de. "Noções de grafos dirigidos, cadeias de Markov e as buscas do Google." Universidade Federal de Sergipe, 2014. https://ri.ufs.br/handle/riufs/6482.

Full text

Abstract:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES<br>This paper has as its main purpose to highlight some mathematical concepts, which are behind the ranking given by a research made on the website mostly used in the world: Google. At the beginning, we briefly approached some High School’s concepts, such as: Matrices, Linear Systems and Probability. After that, we presented some basic notions related to Directed Graphs and Markov Chains of Discrete Time. From this last one, we gave more emphasis to the Steady State Vector because it ensures foreknowledge results from lo

APA, Harvard, Vancouver, ISO, and other styles

49

Possagnolo, Leonardo Henrique Faria Macedo. "Planejamento da expansão de sistemas de distribuição de energia elétrica considerando restauração do fornecimento /." Ilha Solteira, 2019. http://hdl.handle.net/11449/181600.

Full text

Abstract:

Orientador: Rubén Augusto Romero Lázaro<br>Resumo: A grande maioria dos sistemas de distribuição de energia elétrica opera de forma radial. Isso significa que cada carga é alimentada por apenas uma subestação por meio de um único caminho. Entretanto, as redes de distribuição apresentam estrutura malhada, de forma que, caso uma contingência ocorra, o restabelecimento do fornecimento possa ser realizado para o maior número possível de consumidores. Os trabalhos que lidam com o problema de planejamento da expansão de sistemas de distribuição, no entanto, geralmente consideram a expansão do sistem

APA, Harvard, Vancouver, ISO, and other styles

50

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!