Teses / dissertações sobre o tema "Linear search"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Linear search".
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.
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.
Texto completo da fonteHepburn, 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.
Texto completo da fonteBothwell, 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.
Texto completo da fonteCumulative 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 problems. This thesis considers two alternate linear programming formulations for CSEGs. Since both contain a large number of variables and constraints, the linear programming problems are initially solved with many of the constraints removed. If the solution to this relaxed problem is not a feasible optimal solution, additional constraints are added and the problem is solved again. This process continues until a feasible optimal solution is found. The results from a numerical experimentation with various solution techniques are also presented.
Madabushi, Ananth R. "Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems". Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36833.
Texto completo da fonteMaster of Science
Kim, Seongsu. "A BAYESIAN EVIDENCE DEFINING SEARCH". The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429789001.
Texto completo da fonteLaw, 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.
Texto completo da fonteStokes, Klara. "Combinatorial structures for anonymous database search". Doctoral thesis, Universitat Rovira i Virgili, 2011. http://hdl.handle.net/10803/52799.
Texto completo da fonteVasireddy, Jhansi Lakshmi. "Applications of Linear Algebra to Information Retrieval". Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/math_theses/71.
Texto completo da fonteLopez, Soto Claudia Orquidea. "Formulation space search for two-dimensional packing problems". Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7455.
Texto completo da fonteLazic, 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.
Texto completo da fonteDimelow, 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.
Texto completo da fonteKevorkiants, 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.
Texto completo da fonteRossmanith, 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.
Texto completo da fonteTORTI, 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.
Texto completo da fonteSands, 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.
Texto completo da fonteGardenghi, 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/.
Texto completo da fonteIn this work, we propose an interior-point method for large-scale linearly constrained optimization. This method explores the linearity of the constraints, starting from a feasible point and preserving the feasibility of the iterates. We present the main global convergence results, together with a rich description of the implementation details of all the steps of the method. To validate the implementation of the method, we present a wide set of numerical experiments and a comparative analysis with well known softwares of the continuous optimization community.
Chhabra, Meenal. "Studies in the Algorithmic Pricing of Information Goods and Services". Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/25874.
Texto completo da fontePh. D.
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/.
Texto completo da fonteThe identification of influential and/or atypical observations in a data set is known as a part of the diagnostic analysis. One of the purposes of the diagnostic analysis is to verify the robustness of a statistical model, as the non-identification of influential observations can affect the analysis or may cause the obtainment of incorrect results. The most commonly used methodology for the diagnostic of influential observations in regression models are the global influence (Belsey et al., 1980). Cook (1986) introduced a general method to evaluate the local influence of small perturbations in the statistical model or in the data set using different perturbation schemes. As a complement to the techniques of detection atypical observations, it is proposed the forward search procedure by Atkinson e Riani (2000), which is a methodology to detect the masked atypical observations in a data set. In this work we propose the use of the local influence approach together with the forward search to obtain the masked influential observations in linear regression models.
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.
Texto completo da fonteNg, 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.
Texto completo da fonteHaddow, 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.
Texto completo da fonteRossmanith, Gregor [Verfasser], e 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.
Texto completo da fontePakusa, Wied [Verfasser], Erich [Akademischer Betreuer] Grädel, Martin [Akademischer Betreuer] Otto e 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.
Texto completo da fontePakusa, Wied [Verfasser], Erich Akademischer Betreuer] Grädel, Martin [Akademischer Betreuer] Otto e 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.
Texto completo da fontePal, 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.
Texto completo da fonteApproved 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)
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 Disertação-Anibrata Pal.pdf: 1139751 bytes, checksum: a29e1923e75e239365abac2dc74c7f40 (MD5)
Made available in DSpace on 2016-08-15T17:57:29Z (GMT). No. of bitstreams: 1 Disertação-Anibrata Pal.pdf: 1139751 bytes, checksum: a29e1923e75e239365abac2dc74c7f40 (MD5) Previous issue date: 2016-04-19
CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
The world of information retrieval revolves around web search engines. Text search engines are one of the most important source for routing information. The web search engines index huge volumes of data and handles billions of documents. The learn to rank methods have been adopted in the recent past to generate high quality answers for the search engines. The ultimate goal of these systems are to provide high quality results and, at the same time, reduce the computational time for query processing. Drawing direct correlation from the aforementioned fact; reading from smaller or compact indexes always accelerate data read or in other words, reduce computational time during query processing. In this thesis we study about using learning to rank method to not only produce high quality ranking of search results, but also to optimize another important aspect of search systems, the compression achieved in their indexes. We show that it is possible to achieve impressive gains in search engine index compression with virtually no loss in the final quality of results by using simple, yet effective, multi objective optimization techniques in the learning process. We also used basic pruning techniques to find out the impact of pruning in the compression of indexes. In our best approach, we were able to achieve more than 40% compression of the existing index, while keeping the quality of results at par with methods that disregard compression.
Máquinas de busca web para a web indexam grandes volumes de dados, lidando com coleções que muitas vezes são compostas por dezenas de bilhões de documentos. Métodos aprendizagem de máquina têm sido adotados para gerar as respostas de alta qualidade nesses sistemas e, mais recentemente, há métodos de aprendizagem de máquina propostos para a fusão de evidências durante o processo de indexação das bases de dados. Estes métodos servem então não somente para melhorar a qualidade de respostas em sistemas de busca, mas também para reduzir custos de processamento de consultas. O único método de fusão de evidências em tempo de indexação proposto na literatura tem como foco exclusivamente o aprendizado de funções de fusão de evidências que gerem bons resultados durante o processamento de consulta, buscando otimizar este único objetivo no processo de aprendizagem. O presente trabalho apresenta uma proposta onde utiliza-se o método de aprendizagem com múltiplos objetivos, visando otimizar, ao mesmo tempo, tanto a qualidade de respostas produzidas quando o grau de compressão do índice produzido pela fusão de rankings. Os resultados apresentados indicam que a adoção de um processo de aprendizagem com múltiplos objetivos permite que se obtenha melhora significativa na compressão dos índices produzidos sem que haja perda significativa na qualidade final do ranking produzido pelo sistema.
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/.
Texto completo da fonteThe production environment addressed herein is the Flexible Job Shop (FJS), a generalization of the Job Shop (JS). In the JS environment, the jobs scheduling problem is classified by Garey; Johnson and Sethi (1976) as NP-Hard and the FJS is at least as difficult as the JS. FJS is composed of a set of jobs, each consisting of operations. Each operation must be processed individually, without interruption, in a single machine of a subset of enabled machines. The main performance criterion is minimizing the jobs tardiness. Mixed Integer Linear Programming (MILP) models are presented. These models minimize the total tardiness and the completion time of the last operation, makespan. New priority rules of jobs are proposed, as well as adaptations of rules from the literature. These rules are used by constructive heuristics and are combined with strategies aimed at exploiting specific characteristics of FSJ. In order to improve the solutions initially obtained, local searches and other improvement mechanisms are proposed and used in the development of metaheuristics of three different categories. These metaheuristics are: Iterated Local Search (ILS), classified as trajectory metaheuristic; Greedy Randomized Adaptive Search (GRASP), constructive metaheuristic, and Artificial Bee Colony (ABC), recently proposed population metaheuristic. These methods were selected owing to their good results for various optimization problems in the literature. Computational experiments using 600 FJS instances are carried out to allow comparisons between the resolution methods. The results show that exploiting the characteristics of the problem allows one of the proposed priority rules to exceed the best literature rule in about 81% of instances. Metaheuristics ILS, GRASP and ABC achieve more than 31% improvement over the initial solutions and obtain an average tardiness only 2.24% higher than the optimal solutions. Modifications in metaheuristics are proposed to obtain even more significant improvements without increased execution time. Additionally, a version called Disassembly and Assembly FSJ (DAFJS) is studied and the experiments performed with a set of 150 instances also indicate good performance of the methods developed.
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.
Texto completo da fontePh. D.
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.
Texto completo da fonteSource: Masters Abstracts International, Volume: 45-06, page: 2711. Typescript. Abstract appears on leaves 2-3. Includes bibliographical references (leaves 65-67).
Wang, Jiexin. "Policy Hyperparameter Exploration for Behavioral Learning of Smartphone Robots". 京都大学 (Kyoto University), 2017. http://hdl.handle.net/2433/225744.
Texto completo da fonteO'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/.
Texto completo da fonteParker, R. Gary, Committee Member ; Shapiro, Alexander, Committee Member ; Nemirovski, Arkadi, Committee Member ; Green, William, Committee Member ; Monteiro, Renato, Committee Chair.
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/.
Texto completo da fonteThis work presents the identification of parameters of the tubular linear induction motor for the extraction of oil, called MATÆOS - which is the Portuguese acronym for Asynchronous Tubular Motor for Application to Subterranean Oil Extraction. The first step to the identification of the motor parameters was the implementation of the supervisory and control system for the test bench. The model, which is the usual one containing resistors and inductors, represents the motor operating in steady-state. The parameter identification problem was written as an optimization problem based on the motor power balance. An error between the measured power and the one given by the model was defined and minimized with respect to the model parameters in correspondence to a given set of slipping frequencies. The numerical solution to this problem was obtained by an exhaustive search algorithm. This choice was made because the number of independent variables is small and a region containing the solution is known with a significant degree of confidence. The results obtained show that the nominal values of the model parameters differ slightly from those produced by the identification method. Possibly, such differences are due to the variations in the model caused by temperature changes and to the measurement errors. The identified model presented both a lower available force and a worst efficiency when compared to the nominal design values for the warm motor. Despite this the characteristic curve of the model was quite close to the nominal design one.
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.
Texto completo da fonteGames 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.
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.
We focus on solving graph games by using iterative strategy improvement and methods from linear programming and combinatorial optimization. To this end we consider old strategy evaluation functions, construct new ones, and show how all of them, due to their structural similarities, fit into a unifying combinatorial framework. This allows us to employ randomized optimization methods from combinatorial linear programming to solve the games in expected subexponential time.
We introduce and study the concept of a controlled optimization problem, capturing the essential features of many graph games, and provide sufficent conditions for solvability of such problems in expected subexponential time.
The discrete strategy evaluation function for mean payoff games we derive from the new controlled longest-shortest path problem, leads to improvement algorithms that are considerably more efficient than the previously known ones, and also improves the efficiency of algorithms for parity games.
We also define the controlled linear programming problem, and show how the games are translated into this setting. Subclasses of the problem, more general than the games considered, are shown to belong to NP intersection coNP, or even to be solvable by subexponential algorithms.
Finally, we take the first steps in investigating the fixed-parameter complexity of parity, Rabin, Streett, and Muller games.
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/.
Texto completo da fonteThe Spectral Gradient method, introduced by Barzilai and Borwein and analized by Raydan for unconstrained minimization, is a simple method whose performance is comparable to traditional methods, such as conjugate gradients. Since the introduction of method, as well as its extension to minimization of convex sets, there were introduced various combinations of different spectral steplengths, as well as different nonmonotone line searches. By the numerical results presented in many studies it is not possible to infer whether there are siginificant differences in the performance of various methods. It also is not sure the relevance of the nonmonotone line searches as a tool in themselves or whether, in fact, they are usefull only to allow the method to be as similar as possible with the original method of Barzilai e Borwein. The objective of this study is to compare the different methods recently introduced as different combinations of nonmonotone linear searches and different spectral steplengths to find the best combination and from there, evaluating the numerical performance of the method.
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.
Texto completo da fonteChen, 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.
Texto completo da fonteMazzieri, 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/.
Texto completo da fonteKhorbatly, 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.
Texto completo da fonteThe work presented in this thesis is part of human evacuation methods. It aims to study the capacities, model the evacuation problem (wounded, victims, children, elderly, etc.) in a crisis situation (terrorist attacks, natural disasters, etc.) and to develops methods for decision making while proposing better planning and optimal evacuation plans for populations from the crisis zone to hospitals.Our job is to solve the wounded evacuation problem in crisis zone with a new vision that optimizes the transport time and thus saving the maximum of causalities in a dynamic, efficient and fast way in order to minimize human loss
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.
Texto completo da fonteDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica
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
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 de parâmetros de algoritmos, e aplicar o método SID-PSM de modo a encontrar parâmetros ótimos para o próprio método SID-PSM em relação ao número de avaliações de função que o método realiza. Os experimentos numéricos realizados mostram que o SID-PSM _e mais robusto e mais eficiente que os métodos clássicos sem derivadas (busca padrão e Nelder-Mead). Outros experimentos nos mostram o potencial do problema de otimização de parâmetros de algoritmos em melhorar tanto a eficiência quanto a robustez dos métodos
Abstract: The aim of this paper is to present some derivative-free methods for unconstrained minimization problems, such as Nelder-Mead, pattern search and SID-PSM, and compare them. We also intend to present the problem of optimal algorithmic parameters, and apply the method SID-PSM in order to find optimal parameters for the method SID-PSM itself in relation to the number of function evaluations performed by the method. The numerical experiments performed show that the SID-PSM is more robust and more efficient than the classical derivative-free methods (pattern search and Nelder-Mead). Other experiments show us the potential of the problem of optimal algorithmic parameters to improve both the efficiency and the robustness of the methods
Mestrado
Matematica Aplicada
Mestre em Matemática Aplicada
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.
Texto completo da fonteThis paper aims to present solutions for nonlinear systems with multiple roots, using a hybrid algorithm. For this purpose was developed and implemented an algorithm based on random search method proposed by Luus and Jaakola (1973) as a step in search of random starting points, which will be refined through the algorithm of Hooke and Jeeves. The differential of this work is to propose a hybrid algorithm, using the characteristics of the Luus-Jaakola algorithm and Hooke and Jeeves as a search and refinement stages respectively. For this, the above algorithms are encapsulated in functions in the hybrid algorithm. Besides these two steps, the hybrid algorithm has two other important characteristics, which is the execution repeated until to reach a sufficient number of distinct solutions, which is then undergo a process of classification of solutions by interval, where each interval generates a set solutions to close, which in turn is subject to the final stage of minimization, resulting in only one value per class of solution. Thus each class provides a unique solution, which is part of the final set of solutions of the problem, because this algorithm is applied to problems with multiple solutions. So, the hybrid algorithm developed was tested, with the standard, several problems of classical non-linear programming, in particular the unrestricted problems with multiple solutions. After the tests, the results were compared with algorithm Luus-Jaakola, and the Interval Newton/Generalized Bisection method (IN/GB), in order to obtain a quantitative and qualitative analysis of their performance. Finally it was found that the hybrid algortimo achieved higher when compared to the others.
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.
Texto completo da fonteIn this thesis we propose a heuristic method for the Supply Chain Network Design (SCND) problem considering several aspects of practical relevance: suppliers and raw materials, location and operation facilities, distribution center (DC) assignments, and large numbers of customers and products. An efficient two-phase heuristic approach is proposed for obtaining feasible solutions to the problems, which is initially modeled as a large-scale Mixed Integer Linear Program (MILP). In the construction phase, a linear programming rounding strategy is applied to obtain initial values for the integer location variables in the model. Simultaneously, a Multi-start method was developed to generate diversified initial solutions from each new iteration in the rounding heuristic. In the second phase, two Local Search procedures were developed towards to improve the solution provided by the rounding method. We implemented two different Local Search approaches: removal-insertion and exchange. A Tabu Search technique was developed to guide the Local Search procedure to explore the different spaces of solutions. The formulations and algorithms were implemented in C++ code language using the optimization engine COIN-OR. The solution method was experimented in randomly generated instances, with different sizes in terms of the number of parameters, such as number of products, customer zones, DCs, and factories considering a four-echelon logistic system. The computational implementations show that the solution method proposed obtained satisfactory results when compared to the literature review. To validate this heuristic method was also used in a realistic case, based on data from a rubber company that is restructuring its supply chain due to the overture of a new factory, producing new products. The proposed heuristic approach proved appropriate to practical application in a realistic case of a multi commodity industry in a deterministic context.
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.
Texto completo da fonteDissertaçã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
Inclui bibliografia
Área de concentração : Políticas públicas
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.
Texto completo da fonteOne-to-one meeting scheduling problems are problems where a population of actors want to meet each other during short time slots that take place in a single session. In this thesis, we reference several applications of this type of problems found in the literature and introduce a notation extending the well-known scheduling notation α|β|γ. We are particularly interested in a case in which two distinct populations meet, participants may arrive late and some meetings are forbidden. The objective is to minimize the maximum number of participants waiting slots. First, we study the complexity of these problems: we show that several cases with no forbidden meeting are polynomial and that the general case is NP-complete in the strong sense. We then propose lower bounds. After that, we develop several resolution methods. Integer linear programming models and a constraint programming model are developed. To limit the solution space, we add dominance rules based on symmetries to these methods. Finally, we present a limited discrepancy search (i.e. an approximate method based on the exploration of a truncated tree search). In this method, we use as much as possible the symmetry properties of the problem to facilitate the convergence to a good solution. All these methods are tested and compared on a set of 300 randomly generated instances from realistic parameters
May, Lauren Jeanette. "Design, analysis and implementation of symmetric block ciphers". Thesis, Queensland University of Technology, 2002.
Encontre o texto completo da fonteSehovic, Mirsad, e 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.
Texto completo da fonteThe following study examines whether it is possible to implement reachability testing in a map editor designed for 2D-platform games. The purpose of reachability testing is to replace manual testing, that being the level designer having to play through the map just to see if the player can reach all supposedly reachable positions in the map.A simple map editor is created to enable the implementation after which we perform a theoretical study in order to determine which algorithm would be best suited for the implementation of the reachability testing.The results comparing algorithms shows that A* (A star) worked best with the function. Whether or not manual testing can be replaced by automatic testing is open for debate, however the results points to an increase in time efficiency when it comes to level design.
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.
Texto completo da fonteHellberg, Joakim, e 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.
Texto completo da fonteSatellitkommunikation är en allmänt känd metod för att kommunicera med avlägsna eller katastrofdrabbade platser. Ibland kan kommunikationen vara en fråga om liv och död, och det är därför viktigt att den fungerar bra. För tvåvägskommunikation (som internet) är det nödvändigt att antennen på jorden pekar mot satelliten med ett pekfel som inte är större än några tiondels grader. Exempelvis finns det lagar i USA som förbjuder pekfel större än 0,5°. I vissa fall måste antennen på jorden röra sig medan satellitkommunikation upprätthålls. Sådana fall kan vara när antennen är monterad på ett fordon och antennen således måste kompensera för fordonets rörelse för att peka mot satelliten. Denna applikation av satellitkommunikation kallas Satcom on the Move(SOTM). Genom att konstruera en simulinkmodell av ett fullständigt SOTM-system, inklusive fordonsdynamik, satellitposition, signalbeteende, sensorer och ställdon, kan olika reglerstrategier jämföras. Denna avhandling jämför en H2 - och en LQG-regulator för ett statiskt fall, samt ett dynamiskt fall. Det statiska fallet utförs med en sökalgoritm (spiralsökning) som syftar till att hitta en specifik satellitsignal på kortast möjliga tid för ett givet initialt pekfel. Det dynamiska fallet utförs genom att låta det simulerade fordonet köra i slalommönster och på ojämnt underlag. Regulatorerna är designade baserade på modern kontrollteori. Slutsatsen av denna avhandling är att H2-regulatorn presterar något bättre i det statiska testfallet, medan LQG-regulatorn presterar något bättre i de dynamiska testfallen. Resultaten påverkas emellertid kraftigt av de designade reglerparametrarna, vilket innebär att jämförelsen inte nödvändigtvis är sann för kontrollerna, utan snarare förde specifika reglerparametrarna.
Nguyen, Tuan. "Adaptive visual tracking via multiple appearance models and multiple linear searches". Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/28565/.
Texto completo da fonteOliveira, 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.
Texto completo da fonteThis 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 long-term. These concepts are extremely important to our paper, because they will be used to explain the involvement of Mathematic behind the web search “Google”. Then, we tried to detail the ranking operation of the search pages on Google, i.e., how the results of a research are classified, determining which results are presented in a sequential way in order of relevance. Finally we obtained “PageRank”, an algorithm which creates what we call Google’s Matrices and ranks the pages of a search. We finished making a brief comment about the historical arising of the web searches, from their founders to the rise and hegemony of Google.
O presente trabalho tem como objetivo destacar alguns conceitos matemáticos que estão por trás do ranqueamento dado por uma pesquisa feita no site de busca mais usados do mundo, o “Google”. Inicialmente abordamos de forma breve alguns conteúdos da matemática do ensino médio, a exemplo de: matrizes, sistemas lineares, probabilidades. Em seguida são introduzidas noções básicas de grafos dirigidos e cadeias de Markov de tempo discreto; essa última, é dada uma ênfase ao vetor estado estacionário, por ele garantir resultados de previsão de longo prazo. Esses conceitos são de grande importância em nosso trabalho, pois serão usados para explicar o envolvimento da matemática por trás do site de buscas “Google”. Na sequência, buscamos detalhar o funcionamento do ranqueamento das páginas de uma busca no “Google”, isto é, como são classificados os resultados de uma pesquisa, determinando quais resultados serão apresentados de modo sequencial em ordem de relevância. Finalmente, chegamos na obtenção do “PageRank”, algoritmo que gera a chamada Matriz do Google e ranqueia as páginas de uma busca. Encerramos com um breve histórico do surgimento dos sites de buscas, desde os seus fundadores até a ascensão e hegemonia do Google.
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.
Texto completo da fonteResumo: 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 sistema para apenas uma topologia radial, sem levar em conta aspectos da restauração do fornecimento para melhoria dos índices de confiabilidade. Nesse contexto, este trabalho aborda o planejamento de sistemas de distribuição considerando aspectos econômicos e de confiabilidade, de forma a incluir a restauração do fornecimento no problema de planejamento da expansão. Na formulação do problema considera-se a expansão de novas subestações, o reforço de subestações existentes, a construção de novos alimentadores em novos caminhos, a troca de condutores existentes e a alocação de geradores distribuídos, além de expansão multiestágio e restauração do fornecimento para melhoria dos índices de confiabilidade. Dois métodos alternativos são propostos para resolver o problema descrito: o primeiro considera modelos matemáticos com diversos graus de precisão, para serem resolvidos por métodos exatos, e o segundo é uma meta-heurística de busca e vizinhança... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The vast majority of electricity distribution systems are operated radially. This means that each load is supplied by only one substation through a single path. However, distribution networks have a meshed structure so that, in the case of a contingency, the supply is restored to as many customers as possible. The works that deal with the distribution systems expansion planning problem, however, generally consider the expansion of the system for only one radial topology, disregarding the restoration aspects to improve reliability indices. In this context, this work deals with the planning of distribution systems considering economic and reliability aspects, to include the service restoration in the planning problem. In the formulation of the problem, it is considered the expansion of new substations, the reinforcement of existing substations, the construction of new feeders in new paths, the exchange of existing conductors, and the allocation of distribution generation, besides multistage expansion and service restoration to improve the reliability indices of the system. Two alternative methods are proposed to solve the described problem: the first one considers relaxed or approximated mathematical models to be solved by exact methods, and the second one is a variable neighborhood search metaheuristic, which solves the complete model for the problem approximately, without guarantee of optimality. The initial solution of the metaheuristic is generated by a strategy that constr... (Complete abstract click electronic access below)
Doutor
Jin, Shendan. "Online computation beyond standard models". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS152.
Texto completo da fonteIn the standard setting of online computation, the input is not entirely available from the beginning, but is revealed incrementally, piece by piece, as a sequence of requests. Whenever a request arrives, the online algorithm has to make immediately irrevocable decisions to serve the request, without knowledge on the future requests. Usually, the standard framework to evaluate the performance of online algorithms is competitive analysis, which compares the worst-case performance of an online algorithm to an offline optimal solution. In this thesis, we will study some new ways of looking at online problems. First, we study the online computation in the recourse model, in which the irrevocability on online decisions is relaxed. In other words, the online algorithm is allowed to go back and change previously made decisions. More precisely, we show how to identify the trade-off between the number of re-optimization and the performance of online algorithms for the online maximum matching problem. Moreover, we study measures other than competitive analysis for evaluating the performance of online algorithms. We observe that sometimes, competitive analysis cannot distinguish the performance of different algorithms due to the worst-case nature of the competitive ratio. We demonstrate that a similar situation arises in the linear search problem. More precisely, we revisit the linear search problem and introduce a measure, which can be applied as a refinement of the competitive ratio. Last, we study the online computation in the advice model, in which the algorithm receives as input not only a sequence of requests, but also some advice on the request sequence. Specifically, we study a recent model with untrusted advice, in which the advice can be either trusted or untrusted. Assume that in the latter case, the advice can be generated from a malicious source. We show how to identify a Pareto optimal strategy for the online bidding problem in the untrusted advice model