Tesis sobre el tema "Problems"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Problems".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Tautenhahn, Ulrich, Uno Hämarik, Bernd Hofmann y Yuanyuan Shao. "Conditional stability estimates for ill-posed PDE problems by using interpolation". Universitätsbibliothek Chemnitz, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-72654.
Texto completoJones, Troy. "Working Through Problems: An Investigation of the Problems and Problem-Solving Approaches of Beginning Teachers". Diss., Virginia Tech, 2008. http://hdl.handle.net/10919/28736.
Texto completoPh. D.
Sneddon, Penny L. "Sleep Problems in Young Children With and Without Behavior Problems". DigitalCommons@USU, 2007. https://digitalcommons.usu.edu/etd/6127.
Texto completoAli, Ismail 1961. "Uniqueness of Positive Solutions for Elliptic Dirichlet Problems". Thesis, University of North Texas, 1990. https://digital.library.unt.edu/ark:/67531/metadc330654/.
Texto completoQueiroz, Thiago Alves de. "Algoritmos para problemas de corte e empacotamento". [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275759.
Texto completoTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-18T01:07:44Z (GMT). No. of bitstreams: 1 Queiroz_ThiagoAlvesde_D.pdf: 1460601 bytes, checksum: 0d83e25259c427329e25174c2e729e77 (MD5) Previous issue date: 2010
Resumo: Problemas de Corte e Empacotamento são, em sua maioria, NP-difíceis e não existem algoritmos exatos de tempo polinomial para tais se for considerado P ¿ NP. Aplicações práticas envolvendo estes problemas incluem a alocação de recursos para computadores; o corte de chapas de ferro, de madeira, de vidro, de alumínio, peças em couro, etc.; a estocagem de objetos; e, o carregamento de objetos dentro de contêineres ou caminhões-baú. Nesta tese investigamos problemas de Corte e Empacotamento NP-difíceis, nas suas versões bi- e tridimensionais, considerando diversas restrições práticas impostas a tais, a saber: que permitem a rotação ortogonal dos itens; cujos cortes sejam feitos por uma guilhotina; cujos cortes sejam feitos por uma guilhotina respeitando um número máximo de estágios de corte; cujos cortes sejam não-guilhotinados; cujos itens tenham demanda (não) unitária; cujos recipientes tenham tamanhos diferentes; cujos itens sejam representados por polígonos convexos e não-convexos (formas irregulares); cujo empacotamento respeite critérios de estabilidade para corpos rígidos; cujo empacotamento satisfaça uma dada ordem de descarregamento; e, cujos empacotamentos intermediários e final tenham seu centro de gravidade dentro de uma região considerada "segura". Para estes problemas foram propostos algoritmos baseados em programação dinâmica; modelos de programação inteira; técnicas do tipo branch-and-cut; heurísticas, incluindo as baseadas na técnica de geração de colunas; e, meta-heurísticas como o GRASP. Resultados teóricos também foram obtidos. Provamos uma questão em aberto levantada na literatura sobre cortes não-guilhotinados restritos a um conjunto de pontos. Uma extensiva série de testes computacionais considerando instâncias reais e várias outras geradas de forma aleatória foram realizados com os algoritmos desenvolvidos. Os resultados computacionais, sendo alguns deles comparados com a literatura, comprovam a validade dos algoritmos propostos e a sua aplicabilidade prática para resolver os problemas investigados
Abstract: Several versions of Cutting and Packing problems are considered NP-hard and, if we consider that P ¿ NP, we do not have any exact polynomial algorithm for solve them. Practical applications arises for such problems and include: resources allocation for computers; cut of steel, wood, glass, aluminum, etc.; packing of objects; and, loading objects into containers and trucks. In this thesis we investigate Cutting and Packing problems that are NP-hard considering theirs two- and three-dimensional versions, and subject to several practical constraints, that are: that allows the items to be orthogonally rotated; whose cuts are guillotine type; whose cuts are guillotine type and performed in at most k stages; whose cuts are non-guillotine type; whose items have varying and unit demand; whose bins are of variable sizes; whose items are represented by convex and non-convex polygons (irregular shapes); whose packing must satisfy the conditions for static equilibrium of rigid bodies; whose packing must satisfy an order to unloading; and, whose intermediaries and resultant packing have theirs center of gravity inside a safety region; Such cutting and packing problems were solved by dynamic programming algorithms; integer linear programming models; branch-and-cut algorithms; several heuristics, including those ones based on column generation approaches, and metaheuristics like GRASP. Theoretical results were also provided, so a recent open question arised by literature about non-guillotine patterns restricted to a set of points was demonstrated. We performed an extensive series of computational experiments for algorithms developed considering several instances presented in literature and others generated at random. These results, some of them compared with the literature, validate the approaches proposed and suggest their applicability to deal with practical situations involving the problems here investigated
Doutorado
Doutor em Ciência da Computação
Santos, Tânia Cerqueira. "Percepção de pais e educadoras sobre os problemas de externalização e internalização das crianças em idade pré-escolar". Master's thesis, [s.n.], 2011. http://hdl.handle.net/10284/1986.
Texto completoA presente investigação tem como objectivo descrever os problemas de externalização e internalização aliandos à temática da parentalidade. A fundamentação teórica é composta numa primeira fase pela perspectiva da psicologia do desenvolvimento em idade pré-escolar, o contexto, organização e gestão do jardim de infância. Os problemas de conduta e problemas emocionais integram o segundo capítulo e por fim o tema da parentalidade. Na elaboração do estudo empírico e recorrendo à literatura procedeu-se à criação dos seguintes objectivos: (a) perceber se há diferenças na percepção acerca dos comportamentos de internalização e externalização das crianças entre os pais e educadoras (Lopes, 2002; Stivanin, Scheur & Assumpção Jr, 2008); (b) averiguar se existem diferenças entre a escala total de problemas emocionais e a idade das crianças (Oliveira, 2007); (c) entender se há diferenças entre os problemas de internalizção e externalização dependendo do género da criança (Papalia, Olds & Feldman, 2001; Stivanin, Scheuer & Assumpção Jr, 2008); (d) perceber se existem diferenças entre a escala total dos problemas de externalização e a idade das crianças (Oliveira, 2007; Papalia, Olds & Feldman, 2001; Silva, 2008). Foi administrado o questionário SDQ – Questionário de capacidades e dificuldades aos pais e educadoras de oitenta crianças em idade pré-escolar como forma de conhecer as dificuldades e capacidades das crianças de acordo com os dois agentes educativos. Após a análise dos objectivos do estudo pode-se verificar os seguintes resultados: (a) existem diferenças entre a percepção dos pais e educadoras relativamente aos comportamentos das crianças; (b) os problemas de comportamento não variam de forma significativa em função da idade; (c) os problemas de internalização e externalização não variam em função do género; (d) a idade das crianças não influencia os problemas de externalização. Mostra-se importante investir no estudo da problemática dos problemas de conduta e problemas emocionais aliados à parentalidade como forma de melhorar a “tarefa” de educar.--- This research was aimed to describe the problems of internalizing and externalizing combined to the parenting thematic. The theoretical basis is composed initially from the perspective of developmental psychology at preschool age, context, organization and management of the kindergarten. Conduct problems and emotional problems are part of the second chapter and finally, the topic of parenting. In developing the empirical study and using the literature, the following objectives were established: (a) see if there are differences in children’s perception of internalizing and externalizing behaviors between parents and educators (Lopes, 2002; Stivanin, Scheur & Assumpção Jr, 2008); (b) see if there are differences between the full range of emotional problems and the age of children (Oliveira, 2007); (c) understand whether there are differences between the problems of internalizing and externalizing depending on the gender of the child (Papalia, Olds & Feldman, 2001; Stivanin, Scheuer & Assumpção Jr, 2008); (d) understand if there are differences between the overall scale of externalizing problems and the age of children (Oliveira, 2007; Papalia, Olds & Feldman, 2001; Silva, 2008). The SDQ – Strengths and Difficulties was administered to parents and educators of eighty children in preschool as a way to understand the difficulties and abilities according to both school staff. After analyzing the objectives of the study, it is possible to verify the following results: (a) there are differences between the perception of parents and educators in relation to children’s behaviors; (b) behavior problems don’t vary significantly according to age; (c) internalizing and externalizing problems don’t vary according to gender; (d) the child’s age doesn’t influence the problems of externalizing. It reveals important to invest in the studying conduct and emotion problems coupled with parenting as a way to improve the “task” of educating.
Yuen, Gary. "Problem solving strategies students use when solving combinatorial problems". Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/5535.
Texto completoLi, Zhi. "Progressing problems from requirements to specifications in problem frames". Thesis, Open University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.494245.
Texto completoQiang, Feng. "Parallel problem generation for structured problems in mathematical programming". Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/11688.
Texto completoDel, Valle Aline Marques. "Problema da mochila com itens irregulares". [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275763.
Texto completoDissertação (mestrado) - Universidade Estadual de Campinas, Insituto de Computação
Made available in DSpace on 2018-08-17T16:49:45Z (GMT). No. of bitstreams: 1 DelValle_AlineMarques_M.pdf: 1217777 bytes, checksum: 66f10d1b6b4533727cbe82431f97660d (MD5) Previous issue date: 2010
Resumo: Nesta dissertação, estudamos problemas de empacotamento com itens irregulares. Estamos particularmente interessados no Problema da Mochila Bidimensional: dados um recipiente de tamanho W x H e uma lista de itens bidimensionais, o objetivo é empacotar um subconjunto dos itens de forma a maximizar a área dos itens empacotados. Existem diversos trabalhos que lidam com problemas para itens e recipientes bidimensionais com forma regular (retangular). No entanto, são poucos os estudos que tratam de itens com formas irregulares. Nós propomos algoritmos de empacotamento para itens irregulares em recipientes limitados baseados no uso de No-Fit-Polygon (NFP). Este trabalho apresenta uma heurística GRASP para a versão restrita do Problema da Mochila: uma solução inicial gulosa é gerada e, em seguida, utiliza-se um algoritmo de busca local para melhorar solução atual. Uma estratégia híbrida também foi proposta para versão irrestrita do Problema da Mochila. Ela divide-se em passos de empacotamento de itens irregulares e empacotamento de itens regulares. Testamos os algoritmos com instâncias adaptadas do problema de Strip Packing. O GRASP obteve empacotamentos ótimos para várias instancias testadas e, mesmo para as instâncias em que o algoritmo não obteve resultados ótimos, os empacotamentos obtidos tiveram boa taxa de ocupação, com valores relativamente próximos do ótimo. O tempo de execução do algoritmo foi razoável. Na estratégia híbrida, obtiveram-se empacotamentos bons para a maioria das instâncias, com taxa de ocupação acima de 90% e tempos de execução relativamente baixos
Abstract: In this work, we study packing problems dealing with two dimensional irregular items. We are particularly interested in the knapsack version of the problem: given a container with size W x H and a list of two dimensional items, the goal is to pack a subset of items such that the total area of packed items is maximized. There are several works that deal with problems for the case where items and containers have regular shapes (rectangular). However, only a few studies deal with items with irregular shapes. We propose algorithms for packing irregular items in limited containers based on the use of No-Fit-Polygon (NFP). This work presents a GRASP algorithm for the restricted version of the Knapsack Problem: first, a greedy initial solution is generated, then, the local search algorithm is used to improve the current solution. A hybrid strategy has also been proposed for the unrestricted version of the Knapsack Problem. It is divided into steps of packing irregular items and packing regular items. We tested the algorithms using adapted instances for the Strip Packing problem. The GRASP algorithm achieved optimal packings for several of the tested instances, and, even for those that the algorithm did not, the obtained packings had a good occupancy rate, with values relatively close to the optimum. The runtime of the algorithm was reasonable. In the hybrid strategy, we obtained good packings for most of the instances, with occupancy rates above 90% and relatively low execution times
Mestrado
Teoria da Computação
Mestre em Ciência da Computação
Dirsė, Laura. "13 - 16 m. paauglių, turinčių mišrių elgesio ir emocinių sutrikimų, internalių ir eksternalių problemų lygis ir įvairovė". Master's thesis, Lithuanian Academic Libraries Network (LABT), 2007. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_165327-21109.
Texto completoThe aim of the work is to ascertain the level and variety of internal and external problems of 13 – 16 years teenagers having medley behavior and emotional problems. In the beginning of the research was raised hypothesis, that the level of behavior and emotional problems is elevated for teenagers having medley behavior and emotional problems, than for teenagers do not having these problems. In order to achieve the aim we have raised these main objectives: to evaluate the level and variety of internal and external problems of 13 – 16 years teenagers having medley behavior and emotional problems. To evaluate the level and variety of anxiety of 13 – 16 years teenagers having medley behavior and emotional problems. The research was carried out applying these research methods: standardized questionnaire by Achenbach (1991) – Your Self –Report (YSR 11 / 18), Child Behavior Checklist (CBCL 4 / 18); standardized MASC - Multidimensional Anxiety Scale for Children and DAP : SPED Draw A Person : Screening Procedure for Emotional Disturbance. 92 13 -16 years teenagers participated in the research. 52 teenagers, having medley behavior and emotional problems and 40 teenagers do not having these problems. Participated in the research and 52 parents of teenagers, having medley behavior and emotional problems and 40 parents of teenagers, do not having these problems. After the research we carried out, that teenagers, having medley behavior and emotional problems experience more... [to full text]
Nguyen, Thi Phong. "Direct and inverse solvers for scattering problems from locally perturbed infinite periodic layers". Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX004/document.
Texto completoWe are interested in this thesis by the analysis of scattering and inverse scattering problems for locally perturbed periodic infinite layers at a fixed frequency. This problem has connexions with non destructive testings of periodic media like photonics structures, optical fibers, gratings, etc. We first analyze the forward scattering problem and establish some conditions under which there exist no guided modes. This type of conditions is important as it shows that measurements can be done on a layer above the structure without loosing substantial informations in the propagative part of the wave. We then propose a numerical method that solves the direct scattering problem based on Floquet-Bloch transform in the periodicity directions of the background media. We discretize the problem uniformly in the Floquet-Bloch variable and use a spectral method in the space variable. The discretization in space exploits a volumetric reformulation of the problem in a cell (Lippmann-Schwinger integral equation) and a periodization of the kernel in the direction orthogonal to the periodicity. The latter allows the use of FFT techniques to speed up Matrix-Vector product in an iterative to solve the linear system. One ends up with a system of coupled integral equations that can be solved using a Jacobi decomposition. The convergence analysis is done for the case with absorption and numerical validating results are conducted in 2D. For the inverse problem we extend the use of three sampling methods to solve the problem of retrieving the defect from the knowledge of mutistatic data associated with incident near field plane waves. We analyze these methods for the semi-discretized problem in the Floquet-Bloch variable. We then propose a new method capable of retrieving directly the defect without knowing either the background material properties nor the defect properties. This so-called differential-imaging functional that we propose is based on the analysis of sampling methods for a single Floquet-Bloch mode and the relation with solutions toso-called interior transmission problems. The theoretical investigations are corroborated with numerical experiments on synthetic data. Our analysis is done first for the scalar wave equation where the contrast is the lower order term of the Helmholtz operator. We then sketch the extension to the cases where the contrast is also present in the main operator. We complement our thesis with two results on the analysis of the scattering problem for periodic materials with negative indices. Weestablish the well posedness of the problem in 2D in the case of a contrast equals -1. We also show the Fredholm properties of the volume potential formulation of the problem using the T-coercivity approach in the case of a contrast different from -1
Trammell, Eugene. "The effects of instruction in problem-solving strategies including reading word problems on student achievement in solving word problems". DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1986. http://digitalcommons.auctr.edu/dissertations/1376.
Texto completoKojima, Kazuaki y Kazuhisa Miwa. "A System that Generates Word Problems Using Problem Generation Episodes". INTELLIGENT MEDIA INTEGRATION NAGOYA UNIVERSITY / COE, 2005. http://hdl.handle.net/2237/10369.
Texto completoNeufeld, Janis Sebastian. "Problem specific heuristics for group scheduling problems in cellular manufacturing". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-207063.
Texto completoStadler, Sophia. "Child disruptive behaviour problems, problem perception and help-seeking behaviour". Master's thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/26942.
Texto completoPreciso, Luca. "Perturbation Analysis of the Conformal Sewing Problem and Related Problems". Doctoral thesis, Università degli studi di Padova, 1998. http://hdl.handle.net/11577/3425905.
Texto completoSamaitienė, Rūta. "Rolando epilepsija sergančių vaikų EEG pakitimų, miego bei elgesio sutrikimų ir klinikinių charakteristikų sąsajos". Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130919_161212-43923.
Texto completoAlthough patients with benign Rolandic epilepsy (RE) exhibit a benign course of the disease, some of them display sleep and behavioural problems. Seventy five patients with RE, aged 6–11 years, were included in this study. The patients were divided into two subgroups according to the presence of seizures over the preceding 6 months. The comparison group comprised 32 patients without epilepsy and with similar characteristics in terms of age and sex. All patients underwent evaluation of sleep (Sleep Disturbance Scale for Children) and behaviour (Lithuanian version of Child Behaviour Checklist). We examined the sleep and behavioural problems in correlation with the clinical data, EEG data, and simple visual-motor reaction time data. We automatically and manually analysed EEG in the collaboration with Vilnius University Faculty of Mathematics and Informatics. Only patients who had had seizures over the preceding 6 months displayed significantly higher scores for sleep problems (disorders of excessive daytime sleepiness, disorders of sleep breathing, and disorders of sleep-wake transition, longer sleep onset latency), and behavioural problems (social problems, thought problems, attention problems, and aggressive behavior) than the patients of the comparison group. Behavioural problems were associated with the longer epilepsy duration, more frequent and more severe seizures, sleep problems and sleep EEG data (spike frequency >35/min and spike focus, spreading to the other than... [to full text]
Lear, Jonathan. "Intersex : Problems of theory become problems in practice". Thesis, Linköping University, Centre for Applied Ethics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9061.
Texto completoThis paper discusses the medical treatment of intersex infants: children born with ambiguous genitalia, chromosomes, or hormones. The central thesis is that unnecessary surgery, defined as surgery that is not necessary to preserve the life or physical health of the infant, is unethical when performed on infants and should be postponed until the patient is able to participate in, and contribute to, the decision. Three lines of argument are presented: One based on the lack of clinical evidence supporting unnecessary surgery; one based on how unnecessary surgery limits the child’s future choices; and one based on how problematic notions of gender have resulted in problems in practice. Together and separately, the three arguments lead to the conclusion that performing unnecessary surgery on intersex infants is unethical, and wherever possible surgery should be delayed until the patient can participate in the decision.
Huang, Minyao. "Vagueness in language use : problems and pseudo-problems". Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608010.
Texto completoGrohs, Jacob R. "Developing a Measure of Systems Thinking Competency". Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/51996.
Texto completoPh. D.
Li, Yaxian. "Lower bounds for integer programming problems". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/48959.
Texto completoGoulden, Emma. "A comparison of children's performance on problem analogies and analogy problems". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0024/MQ51347.pdf.
Texto completoColeman, Elaine B. "Problem-solving differences between high and average performers on physics problems". Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63961.
Texto completoRuiz, Muñoz Juan Felipe. "The Problem of Formulating Design Problems : A Typology of Design Briefs". Licentiate thesis, Linköpings universitet, Företagsekonomi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-171558.
Texto completoDet är vanligt att ett designteam får ett problem att lösa åt andra. Överlämnandet kallas normalt en ”briefing” -process och dokumentationen av utgångspunkten och vad som ska göras kallas ett ”design brief ”. Det är känt att det sätt vi ramar in och förstår ett problem påverkar vilka vägar vi ser till potentiella lösningar. Syftet med denna avhandling är att förstå vad som gör ett bra ”design brief ” och att göra det för att skapa en empiriskt informerad och teoretiskt underbyggd typologi av design brief och vilken typ av sökprocesser de uppmuntrar. Olika litteratur har försökt förstå hur design löser problem för att förstå designerns beteende och i slutändan underlätta eller förbättra det. Skillnader kan och har gjorts mellan olika typer av problemformuleringar och olika problemlösningsmetoder. Denna avhandling syftar till att integrera två tidigare distinkta litteraturområden, sökprocess ur det organisatoriska perspektivet som utvecklats av James G. March, Herbert A. Simon, Richard Cyert och andra samt Design och designprocessen ur perspektiv av författare som Donald Schön, Kees Dorst och Nigel Cross bland andra för att föreslå en typologi av design brief för att underlätta problemformulering och därmed också underlätta designprocessen. Det enkla och omedelbara svaret på frågan om vad som gör ett bra design brief är: ”det beror på”. Det beror på designprocessen som ska följas (om det finns en), det beror på vilken typ av mål som ska uppnås, den tillgängliga tiden, och det beror också på hur mycket och vad som är känt om problemet och potentiella lösningar. Baserat på detta artikuleras fyra idealtyper av design brief, inklusive det förväntade associerade sökbeteendet och utmaningar för designteam.
ISBN saknas i avhandlingen.
Silveira, Jefferson Luiz Moisés da 1986. "Algoritmos para problemas de empacotamento e roteamento". [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275605.
Texto completoTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-24T00:15:42Z (GMT). No. of bitstreams: 1 Silveira_JeffersonLuizMoisesda_D.pdf: 2236708 bytes, checksum: 8e569408c2f068347058e36031689c3a (MD5) Previous issue date: 2013
Resumo: Neste trabalho estamos interessados em problemas de empacotamento e roteamento. Assumindo a hipótese de que P ? NP, sabemos que não existem algoritmos eficientes para resolver tais problemas. Além de algoritmos exatos, duas das abordagens para resolver tais problemas são Algoritmos Aproximados e Heurísticas. Nesta tese mostramos algoritmos baseados nestas três abordagens para ambos os problemas, de empacotamento e roteamento. Os dois primeiros problemas atacados foram generalizações de problemas clássicos de empacotamento: O problema da mochila bidimensional e o problema de empacotamento em faixas. Estes foram generalizados adicionando restrições na forma de carregamento e descarregamento dos itens no recipiente (restrições estas, que aparecem no contexto de problemas de roteamento). O terceiro problema é uma combinação de problemas de empacotamento e roteamento. Neste caso, atacamos uma generalização do clássico Pickup and Delivery Problem. Propomos os primeiros resultados de aproximação para algumas versões dos problemas de empacotamento supracitados. Além disto, apresentamos algumas abordagens práticas para o terceiro problema. As heurísticas foram avaliadas através de experimentos computacionais comparando os seus resultados com algoritmos exatos
Abstract: In this work we are interested in packing and routing problems. Assuming P ? NP, we have that there are no efficient algorithms to deal with such problems. Besides exact algorithms, two approaches to solve such problems are Approximation Algorithms and Heuristics. In this thesis we show algorithms using these three approaches for both packing and routing problems. The first two addressed problems are generalizations of classical packing problems: The Two Dimensional Knapsack problem and the Strip Packing problem. These problems were generalized by adding constraints on the way the items can be inserted/removed into/from the bin (These constraints appear in the context of routing problems). The third problem is combination of packing and routing problems. It is a generalization of the classical Pickup and Delivery problem. We propose the first approximation results for some packing problems. Besides that, we present some practical algorithms for the third problem. The heuristics were assessed through computational experiments by comparing their results with exact algorithms
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
Cherri, Luiz Henrique. "Nesting problems". Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16112016-150256/.
Texto completoOs problemas de corte e empacotamento de peças irregulares bidimensionais vêm sendo estudados há décadas e consistem em cortar (empacotar) peças menores, convexas e não convexas, a partir de (em) placas maiores de forma a não se sobreporem. Existem diversas variantes deste problema, definidas de acordo com o formato da placa e objetivo de cada problema. Na literatura, muitas heurísticas foram propostas para a resolução dos problemas de corte e empacotamento de peças irregulares, porém, poucos modelos de programação inteira mista podem ser encontrados. Especificamente, estes modelos foram desenvolvidos para o problema de empacotamento em faixa, que consiste em empacotar as peças em uma placa de largura fixa e comprimento a ser minimizado. Para as demais variantes do problema, não existem métodos exatos propostos na literatura. A principal dificuldade na resolução dos problemas de corte e empacotamento de peças irregulares está na manipulação das restrições geométricas. Estas restrições dependem do tipo de posicionamento das peças na placa, que pode ser discreto ou contínuo. Nesta tese, apresentamos dois modelos de programação inteira mista para o problema de empacotamento de peças em faixa, no qual cada peça pode ser alocada de forma contínua na placa. Estes modelos não demandam estruturas complexas para serem construídos. Também apresentamos uma nova estrutura de dados para armazenar informações sobre o posicionamento das peças e as posições de sobreposição, trazendo flexibilidade e eficiência para abordagens discretas. Utilizando esta estrutura, uma matheuristica foi proposta, combinando as vantagens dos modelos com alocação discreta e contínua das peças na placa. Além disso, modelos de programação por restrições para diversas variantes dos problemas de corte e empacotamento de peças irregulares foram explorados. Para algumas variantes, estes modelos são a primeira representação via modelagem. Uma nova restrição global foi desenvolvida para eliminar a sobreposição entre as peças. Experimentos computacionais foram realizados para avaliar as abordagens propostas.
Cherri, Luiz Henrique. "Nesting Problems". Doctoral thesis, Universidade de São Paulo, 2016. https://repositorio-aberto.up.pt/handle/10216/84291.
Texto completoOs problemas de corte e empacotamento de peças irregulares bidimensionais vêm sendo estudados há décadas e consistem em cortar (empacotar) peças menores, convexas e não convexas, a partir de (em) placas maiores de forma a não se sobreporem. Existem diversas variantes deste problema, definidas de acordo com o formato da placa e objetivo de cada problema. Na literatura, muitas heurísticas foram propostas para a resolução dos problemas de corte e empacotamento de peças irregulares, porém, poucos modelos de programação inteira mista podem ser encontrados. Especificamente, estes modelos foram desenvolvidos para o problema de empacotamento em faixa, que consiste em empacotar as peças em uma placa de largura fixa e comprimento a ser minimizado. Para as demais variantes do problema, não existem métodos exatos propostos na literatura. A principal dificuldade na resolução dos problemas de corte e empacotamento de peças irregulares está na manipulação das restrições geométricas. Estas restrições dependem do tipo de posicionamento das peças na placa, que pode ser discreto ou contínuo. Nesta tese, apresentamos dois modelos de programação inteira mista para o problema de empacotamento de peças em faixa, no qual cada peça pode ser alocada de forma contínua na placa. Estes modelos não demandam estruturas complexas para serem construídos. Também apresentamos uma nova estrutura de dados para armazenar informações sobre o posicionamento das peças e as posições de sobreposição, trazendo flexibilidade e eficiência para abordagens discretas. Utilizando esta estrutura, uma matheuristica foi proposta, combinando as vantagens dos modelos com alocação discreta e contínua das peças na placa. Além disso, modelos de programação por restrições para diversas variantes dos problemas de corte e empacotamento de peças irregulares foram explorados. Para algumas variantes, estes modelos são a primeira representação via modelagem. Uma nova restrição global foi desenvolvida para eliminar a sobreposição entre as peças. Experimentos computacionais foram realizados para avaliar as abordagens propostas.
Ivakhnenko, O. "Environmental problems". Thesis, Sumy State University, 2017. http://essuir.sumdu.edu.ua/handle/123456789/65689.
Texto completoЗолотова, Світлана Григорівна, Светлана Григорьевна Золотова, Svitlana Hryhorivna Zolotova y M. S. Dodotchenko. "Ecological problems". Thesis, Видавництво СумДУ, 2010. http://essuir.sumdu.edu.ua/handle/123456789/17927.
Texto completoSeroshtan, J. V. y L. M. Chuchilina. "Ecological problems". Thesis, Видавництво СумДУ, 2008. http://essuir.sumdu.edu.ua/handle/123456789/16039.
Texto completoSamsonenko, L. U. y M. O. Sasyuk. "Environmental problems". Thesis, Sumy State University, 2014. http://essuir.sumdu.edu.ua/handle/123456789/45211.
Texto completoObimpeh, M. O. "Environmental problems". Thesis, Видавництво СумДУ, 2004. http://essuir.sumdu.edu.ua/handle/123456789/23125.
Texto completoSolís, Baltodano Maria José. "Claims problems: An implementation approach". Doctoral thesis, Universitat Rovira i Virgili, 2018. http://hdl.handle.net/10803/663663.
Texto completoEl principal objetivo de esta tesis se centra en el enfoque teórico de los problemas de reclamaciones. Un problema de conflicto de intereses surge cuando hay un recurso insuficiente, que debe distribuirse entre un número agentes. Nuestro objetivo principal es buscar soluciones convenientes y alternativas a este tipo de problemas. Partiendo de este punto, estudiamos dos problemas reales que representan este tipo de conflicto, el problema de presupuesto público en sanidad en Cataluña y los fondos estructurales y de cohesión de la Unión Europea (UE). En el primer caso proponemos una alternativa para distribuir el presupuesto en salud con el fin de mantener la estabilidad de la comunidad. En el segundo caso sugerimos una manera alternativa de repartir el presupuesto a través de reglas de reparto y de la imposición de garantías a cada una de las regiones, con el fin de reducir la desigualdad y promover la convergencia de una manera más adecuada. Además, otro propósito es poder contribuir esta teoría proporcionando (i) nuevas caracterizaciones para dos reglas comúnmente usadas en esta literatura, las cuales son regla de igual ganancias (CEA, por sus siglas en inglés), y la propuesta por Ibn Ezra (the Ibn Ezra proposal). (ii) Proponiendo un nuevo modelo de problema de conflicto de intereses, llamado problemas de reclamos secuenciales, además redefinimos las reglas, proporcional, de igual ganancias (CEA, por sus siglas en inglés), de igual perdidas (CEL, por sus siglas en inglés), y Talmud, con el fin de lograr caracterizarlas a través del uso de axiomas estudiados en este campo.
The main objective of this thesis is on claims problems. We look for suitable and alternative solutions to this kind of problems. From this point of view, we study two real problems that represent these conflicts, the first one is the problem of the public health budget in Catalonia and the second one is the structural and cohesion funds of the European Union (EU). In the first case, we propose an alternative way to distribute the health budget to maintain the stability of the community. In this case we look for a suitable solution using rules and some stability criteria’s. In the second case we suggest an alternative way to distribute the budget through claims rules and the imposition of guarantees to each one of the regions, with the aim to reduce inequality and promote convergence in a more appropriate way. Additionally, another purpose is to be able to contribute to this theory by providing (i) new characterizations for two commonly used rules in this literature, which are the constrained equal awards rule (CEA), and the Ibn Ezra proposal, and (ii) propose a new model of claims problem, called sequential claims problems, in this sense we redefine the proportional, the constrained equal awards, the constrained equal losses and the Talmud rules, and characterize them through the use of axioms studied in this field.
Dou, Lixin. "Procedures for basic inverse problems: Black body radiation problem and phonon density of states problem". Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7544.
Texto completoMartinsson, Linnea. "The Emergence Problems after The Combination Problem : Toward a solution of the problem of experience". Thesis, Umeå universitet, Institutionen för idé- och samhällsstudier, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-172776.
Texto completoAuxter, Abbey Auxter. "The Problem with Word Problems: An Exploratory Study of Factors Related to Word Problem Success". Diss., Temple University Libraries, 2016. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/392790.
Texto completoPh.D.
College Algebra is a gatekeeper course that serves as an obstacle for many students pursuing STEM careers. Lack of success in this course could be a key reason why the United States lags behind other industrialized countries in the number of students graduating with STEM majors and joining the STEM workforce. Of the many topics presented in College Algebra that pose problems, students often have particular difficulty with the application of systems of equations in the form of word problems. The present study aims to identify the factors associated with success and failure on systems of equations word problems. The goal was to identify the factors that remained significant predictors of success in order to build a theory to explain why some students are successful and other have difficulty. Using the Opportunity-Propensity Model of Byrnes and colleagues as the theoretical guide (e.g., Byrnes & Miller-Cotto, 2016), the following questions set the groundwork for the current study: (1) To what extent do antecedent (gender, race/ethnicity, socioeconomic status, and university) and propensity factors (mathematical calculation ability, mathematics anxiety, self-regulation, motivation, and ESL) individually and collectively predict success with systems of equations word problems in College Algebra students, and (2) How do these factors relate to each other? Bivariate correlations and hierarchical multiple regression were used to examine the relationships between the factors and word problem set-up as well as correct completion of the word problems presented. Results indicated after all variables were entered, calculation ability, self-regulation as determined by homework score, and anxiety were the only factors to remain significant predictors of student performance on both levels. All other factors either failed to enter as significant predictors or dropped out when the complete set had been entered. Reasons for this pattern of results are discussed, as are suggestions for future research to confirm and extend these findings.
Temple University--Theses
Rada, Miroslav. "Dvourozměrné řezné problémy". Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-4859.
Texto completoHarutjunjan, G. y Bert-Wolfgang Schulze. "Conormal symbols of mixed elliptic problems with singular interfaces". Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2009/2988/.
Texto completoBain, Stuart y n/a. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Griffith University. School of Information and Communication Technology, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20071126.080227.
Texto completoCossio, Jorge Ivan. "Multiple solutions for semilinear elliptic boundary value problems". Thesis, University of North Texas, 1991. https://digital.library.unt.edu/ark:/67531/metadc332487/.
Texto completoBain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Faculty of Engineering and Information Technology
Full Text
Lafifi, Sohaib. "Vehicle routing problems with resources synchronization". Thesis, Compiègne, 2014. http://www.theses.fr/2014COMP1992.
Texto completoThis dissertation focuses on vehicle routing problems, one of the major academic problems in logistics. We address NP-Hard problems that model some realworld situations particularly those with different temporal constraints including time windows, visit synchronization and service balance.The aim of this research is to develop new algorithms for the considered problems,investigate their performance and compare them with the literature approaches.Two cases are carried out. The first case studies the Vehicle Routing Problem with Time Windows (VRPTW). We propose new lower bound methods for the number of vehicles. Then we present a Particle Swarm Optimization algorithm dealing with the Solomon objective. The second case studies the VehicleRouting Problem with Time Windows and Synchronized Visits (VRPTWsyn).Both exact methods and heuristics are proposed and compared to the literature approaches
Jaudženis, Rolandas. "Įstatymų ir kitų teisės aktų, reglamentuojančių asmenų, grįžusių iš įkalinimo įstaigų, socialinę integraciją, įgyvendinimas: Akmenės rajono pataisos inspekcijos atvejis". Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100903_161250-75227.
Texto completoImplementation of laws and other deeds regulating social integration of individuals released from imprisonment institutions taking the case of Correctional Inspectorate of Akmenė district is analyzed in Bachelor thesis. In theoretical part of the thesis the conceptions of social separation and social integration of individuals released from imprisonment institutions are presented together with conceptions of laws and other deeds, regulating social integration of individuals released from imprisonment institutions. The role of society and state in solving social integration issues of individuals released from imprisonment institutions is revealed. In the research part of the thesis the activities of Correctional Inspectorate of Akmenė district regarding implementation of laws and other deeds regulating social integration of individuals released from imprisonment institutions are analyzed by methods of document analysis, interviews and self-analysis of activities, identifying problems and suggesting solutions to the problems.
Conley, Michele E. "UTILIZING TECHNOLOGY TO ENHANCE READING COMPREHENSION WITHIN MATHEMATICAL WORD PROBLEMS". CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/121.
Texto completoDias, Fábio Carlos Sousa. "Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica". reponame:Repositório Institucional da UFC, 2008. http://www.repositorio.ufc.br/handle/riufc/17871.
Texto completoSubmitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:13:52Z No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:16:23Z (GMT) No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Made available in DSpace on 2016-06-22T17:16:23Z (GMT). No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5) Previous issue date: 2008
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to …nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between …xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to …nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e¢ ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Neste trabalho, estudamos o problema de localização simples (SPLP - Simple Plant Location Problem). Usando a formulação matemática clássica e uma outra formulação proposta recentemente, desenvolvemos vários algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulação clássica, tais limites são obtidos utilizando o método de correção de dados e critérios de dominância entre os custos …xos e de transporte. Propomos uma projeção dessa formulação, que se mostrou computacionalmente atrativa. Usando a nova formulação propomos e mostramos a corretude de vários procedimentos iterativos que procuram encontrar uma solução para o problema, resolvendo uma seqüência de subproblemas paramétricos obtidos com a remoção de variáveis e restrições da formulação original. Em cada iteração desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxação lagrangeana a essa nova formulação para obter outros limites. Analisamos várias possibilidades de relaxação das restrições. Desenvolmento também algoritmos branch-and-bound baseados em ambas as formulações e nos limites obtidos. Avaliamos a e…ciência computacional de todos os algoritmos com instâncias de teste difíceis, disponíveis na literatura. Resultados computacionais e comparações com outros algoritmos da literatura são reportados.
Dias, FÃbio Carlos Sousa. "Algoritmos para o problema de localizaÃÃo simples baseados nas formulaÃÃes clÃssica e canÃnica". Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2827.
Texto completoNeste trabalho, estudamos o problema de localizaÃÃo simples (SPLP - Simple Plant Location Problem). Usando a formulaÃÃo matemÃtica clÃssica e uma outra formulaÃÃo proposta recentemente, desenvolvemos vÃrios algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulaÃÃo clÃssica, tais limites sÃo obtidos utilizando o mÃtodo de correÃÃo de dados e critÃrios de dominÃncia entre os custos xos e de transporte. Propomos uma projeÃÃo dessa formulaÃÃo, que se mostrou computacionalmente atrativa. Usando a nova formulaÃÃo propomos e mostramos a corretude de vÃrios procedimentos iterativos que procuram encontrar uma soluÃÃo para o problema, resolvendo uma seqÃÃncia de subproblemas paramÃtricos obtidos com a remoÃÃo de variÃveis e restriÃÃes da formulaÃÃo original. Em cada iteraÃÃo desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxaÃÃo lagrangeana a essa nova formulaÃÃo para obter outros limites. Analisamos vÃrias possibilidades de relaxaÃÃo das restriÃÃes. Desenvolmento tambÃm algoritmos branch-and-bound baseados em ambas as formulaÃÃes e nos limites obtidos. Avaliamos a e ciÃncia computacional de todos os algoritmos com instÃncias de teste difÃceis, disponÃveis na literatura. Resultados computacionais e comparaÃÃes com outros algoritmos da literatura sÃo reportados.
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Zhao, Kun. "Initial-boundary value problems in fluid dynamics modeling". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31778.
Texto completoCommittee Chair: Pan, Ronghua; Committee Member: Chow, Shui-Nee; Committee Member: Dieci, Luca; Committee Member: Gangbo, Wilfrid; Committee Member: Yeung, Pui-Kuen. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Lafargue, Thomas. "Comportement de matériaux illuminés par des sources laser multi-kW". Electronic Thesis or Diss., Paris, HESAM, 2023. http://www.theses.fr/2023HESAE021.
Texto completoThis thesis subject is part of a medium/long-term project for the researchand development of high-power laser weapons. Indeed, following the diversification ofthreats (targets/operating modes) and the future risks of laser illuminations, MBDA France,in cooperation with ALPhANOV, is developing trials around a high-power continuouslaser. The final objective of MBDA France is to be able to quantify the vulnerability oftargets. Given the variety of families of materials of interest, the degradation mechanismsinvolved in this type of application are numerous (strong thermal, mechanical and chemicalcoupling). In addition, they are poorly documented due to the scarcity of test facilitiesequipped with multi-kW continuous lasers. The doctoral work will make it possible toacquire knowledge and understanding of these laser-matter interaction phenomena thanksto experimental approaches and numerical analyzes
Leão, Aline Aparecida de Souza. "Geração de colunas para problemas de corte em duas fases". Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-20052009-160448/.
Texto completoThe Compartmentalized Knapsack Problem is an extension of the classical Knapsack Problem, where the ordered items are partitioned into classes, in such way that the knapsack must be divided into compartments, each one having limited capacity. In addition, the building of a compartment has a fixed cost and involves a loss of the overall capacity. The objective is to maximize the sum of the items utility value, minus the fixed costs of the compartments. This dissertation presents two solving methods. The first approach is a heuristic method, which is a combination of two heuristics from the literature. The second approach is a Column Generation method, that apart from it gives a new upper bound to the Compartmentalized Knapsack Problem, in the end of the method the master problem was solved with the variables defined as integer, that supplies a feasible solution. In both methods, the mathematical non linear model is decomposed into two linear models, one generates the compartments, and the other selects them to compose the knapsack. The results obtained with these two approaches were compared with an upper bound and they showed very efficient