Rozprawy doktorskie na temat „Problem”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Problem”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
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.
Pełny tekst źródłaMartinsson, 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.
Pełny tekst źródłaAuxter, 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.
Pełny tekst źródłaPh.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
Leão, Aline Aparecida de Souza. "Extensões em problemas de corte: padrões compartimentados e problemas acoplados". Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-03052013-162852/.
Pełny tekst źródłaIn this thesis we present the constrained compartmentalized knapsack problem and the one dimensional cutting stock problem integrated with the capacitated lot sizing problem. For the constrained compartmentalized knapsack problem, the one dimensional version is presented and the two dimensional version is proposed, called one-dimensional compartmentalized knapsack problem and two-dimensional compartmentalized knapsack problem, respectively. For the cutting stock problem integrated with the capacitated lot sizing problem three variations are considered: one machine to produce one type of object; one machine to produce multiple types of objects; multiple machines to produce multiple types of objects. Some integer and mixed programming formulations, decompositions of the problems in master problem and subproblems and heuristics based on column generation method are proposed for the compartmentalized knapsack problem and the cutting stock problem integrated with the capacitated lot sizing problem. In particular, the period, the machine, and the period and machine Dantzig- Wolfe decompositions are applied for the integrated problem. Moreover, a heuristic based on the graph AND/OR is proposed for the two-dimensional compartmentalized knapsack problem. Computational results show that these mathematical formulations and methods provide good solutions
Welsh, Kimberly D. "Individuals solving problems : the effects of problem solving strategies and problem solving technologies on generating solutions". Virtual Press, 1997. http://liblink.bsu.edu/uhtbin/catkey/1045625.
Pełny tekst źródłaDepartment of Psychological Science
Seress, Ãkos. "The gossip problem (communication problem) /". The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487262513408203.
Pełny tekst źródłaSchantz, Jennifer Rufsvold. "The impact of problem-related written disclosure and problem-related visualization on adjustment to stressful interpersonal problems /". The Ohio State University, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488202678774301.
Pełny tekst źródłaGallagher, Kathleen M. "Problem Framing in Problem-Oriented Policing:An Examination of Framing from Problem Definition to Problem Response". University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1406811215.
Pełny tekst źródłaYuen, Gary. "Problem solving strategies students use when solving combinatorial problems". Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/5535.
Pełny tekst źródłaLi, 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.
Pełny tekst źródłaQiang, Feng. "Parallel problem generation for structured problems in mathematical programming". Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/11688.
Pełny tekst źródłaHusain, Dhiaiddin. "Satisfiability problem and lattice basis problem". Aix-Marseille 2, 1996. http://www.theses.fr/1996AIX22037.
Pełny tekst źródłaHyblerová, Zuzana. "Fastfood nutriční problém". Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-15675.
Pełny tekst źródłaLukesová, Kristýna. "Logické úlohy a hlavolamy jako optimalizační problémy". Master's thesis, Vysoká škola ekonomická v Praze, 2011. http://www.nusl.cz/ntk/nusl-113465.
Pełny tekst źródłaTautenhahn, Ulrich, Uno Hämarik, Bernd Hofmann i 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.
Pełny tekst źródłaBååth, Åsa. "Är problemen ett problem för ungdomsboken? Hur uppfattar ungdomar beskrivningarna av problem i samtidsrealistisk ungdomslitteratur utgiven 2001?" Thesis, Högskolan i Borås, Institutionen Biblioteks- och informationsvetenskap / Bibliotekshögskolan, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20906.
Pełny tekst źródłaUppsatsnivå: D
Buck, Dave. "Explaining age-related problem-solving differences on concept identification problems as a function of problem content, strategies, and stereotypes". Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1165.
Pełny tekst źródłaTitle from document title page. Document formatted into pages; contains vi, 86 p. : ill. (some col.) Vita. Includes abstract. Includes bibliographical references (p. 62-65).
Queiroz, Thiago Alves de. "Algoritmos para problemas de corte e empacotamento". [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275759.
Pełny tekst źródłaTese (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
Kojima, Kazuaki, i 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.
Pełny tekst źródłaNeufeld, 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.
Pełny tekst źródłaStadler, 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.
Pełny tekst źródłaPreciso, 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.
Pełny tekst źródłaChu, Yuk-ha Agnes, i 朱玉霞. "First home: a problem or no problem". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31968235.
Pełny tekst źródłaClark, Kevin W. "The problem with the problem of evil". Honors in the Major Thesis, University of Central Florida, 2001. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/216.
Pełny tekst źródłaBachelors
Arts and Sciences
Philosophy
Chu, Yuk-ha Agnes. "First home : a problem or no problem /". Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20125914.
Pełny tekst źródłaCameron, Mark A., i Mark Cameron@csiro au. "A Problem Model for Decision Support Systems". The Australian National University. Faculty of Engineering and Information Technology, 2000. http://thesis.anu.edu.au./public/adt-ANU20020717.144031.
Pełny tekst źródłaAli, Ismail 1961. "Uniqueness of Positive Solutions for Elliptic Dirichlet Problems". Thesis, University of North Texas, 1990. https://digital.library.unt.edu/ark:/67531/metadc330654/.
Pełny tekst źródłaJones, 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.
Pełny tekst źródłaPh. D.
Maramreddy, Sushma. "Online Matching Problem with Application Google Adwords Problem /". Cincinnati, Ohio : University of Cincinnati, 2006. http://www.ohiolink.edu/etd/view.cgi?ucin1163791140.
Pełny tekst źródłaMARAMREDDY, SUSHMA. "ONLINE MATCHING PROBLEM WITH APPLICATION: GOOGLE ADWORDS PROBLEM". University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1163791140.
Pełny tekst źródłaHanberger, Anders. "Lokalpolitikens möjligheter : historisk policyanalys av problemnärhet och effektivitet i kommunal policy och dess betydelse för politisk legitimitet". Doctoral thesis, Umeå universitet, Statsvetenskapliga institutionen, 1997. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-67633.
Pełny tekst źródładigitalisering@umu
Coleman, 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.
Pełny tekst źródłaSilva, Carla Taviane Lucke da. "Otimização de processos acoplados: programação da produção e corte de estoque". Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-13022009-102119/.
Pełny tekst źródłaIn the many manufacturing industries (e.g., paper industry, furniture, steel, textile), lot-sizing decisions generally arise together with other decisions of planning production, such as distribution, cutting, scheduling and others. However, usually, these decisions are dealt with separately, which reduce the solution space and break dependence on decisions, increasing the total costs. In this thesis, we study the production process that arises in small scale furniture industries, which consists basically of cutting large plates available in stock into several thicknesses to obtain different types of pieces required to manufacture lots of ordered products. The cutting and drilling machines are possibly bottlenecks and their capacities have to be taken into account. The lot-sizing and cutting stock problems are coupled with each other in a large scale linear integer optimization model, whose objective function consists in minimizing different costs simultaneously, production, inventory, raw material waste and setup costs. The proposed model captures the tradeoff between making inventory and reducing losses. The impact of the uncertainty of the demand, which is composed with ordered and forecasting products) was smoothed down by a rolling horizon strategy and by new decision variables that represent extra production to meet forecasting demands at the best moment, aiming at total cost minimization. Two heuristic methods are proposed to solve relaxation of the mathematical model. Randomly generated instances based on real world life data were used for the computational experiments for empirical analyses of the model and the proposed solution methods
Goulden, 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.
Pełny tekst źródłaRuiz, 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.
Pełny tekst źródłaDet ä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.
Kapoor, Nidhi. "Pagenumber problem". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0019/MQ48156.pdf.
Pełny tekst źródłaLedwig, Marion. "Newcomb's problem". [S.l. : s.n.], 2000. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8670124.
Pełny tekst źródłaPhillips, Danielson Waltraud. "Managerial Problem Definition: A Descriptive Study of Problem Definers". Thesis, North Texas State University, 1985. https://digital.library.unt.edu/ark:/67531/metadc331384/.
Pełny tekst źródłaFaremo, Sonia. "Medical problem solving and post-problem reflection in BioWorld". Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=84992.
Pełny tekst źródłaSchuler, Matthew Michael. "The Problem of Evil as the Problem of Pain". Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/33003.
Pełny tekst źródłaMaster of Arts
Stoyanova, Elena N. "Extending and exploring students' problem solving via problem posing". Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1997. https://ro.ecu.edu.au/theses/885.
Pełny tekst źródłaAsterová, Jana. "Přířazovací problém a jeho praktická aplikace v oblasti přepravy osob". Master's thesis, Vysoká škola ekonomická v Praze, 2017. http://www.nusl.cz/ntk/nusl-358882.
Pełny tekst źródłaHarutjunjan, Gohar, i Bert-Wolfgang Schulze. "The Zaremba problem with singular interfaces as a corner boundary value problem". Universität Potsdam, 2004. http://opus.kobv.de/ubp/volltexte/2008/2685/.
Pełny tekst źródłai.e., Au = f in int X, T±u = g± on int Y±, where Y is subdivided into subsets Y± with an interface Z and boundary conditions T± on Y± that are Shapiro-Lopatinskij elliptic up to Z from the respective sides. We assume that Z ⊂ Y is a manifold with conical singularity v. As an example we consider the Zaremba problem, where A is the Laplacian and T− Dirichlet, T+ Neumann conditions. The problem is treated as a corner boundary value problem near v which is the new point and the main difficulty in this paper. Outside v the problem belongs to the edge calculus as is shown in [3]. With a mixed problem we associate Fredholm operators in weighted corner Sobolev spaces with double weights, under suitable edge conditions along Z {v} of trace and potential type. We construct parametrices within the calculus and establish the regularity of solutions.
Miller, Catherine Marie 1959. "Teachers as problem solvers/problem solvers as teachers: Teachers' practice and teaching of mathematical problem solving". Diss., The University of Arizona, 1996. http://hdl.handle.net/10150/282150.
Pełny tekst źródłaMakhmudov, Olimdjan, i Nikolai Tarkhanov. "An extremal problem related to analytic continuation". Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6363/.
Pełny tekst źródłaViklands, Thomas. "Algorithms for the Weighted Orthogonal Procrustes Problem and other Least Squares Problems". Doctoral thesis, Umeå : Umeå universitet, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-730.
Pełny tekst źródłaSteitz, Wolfgang [Verfasser]. "Problem-specific design of metaheuristics for constrained spanning tree problems / Wolfgang Steitz". Mainz : Universitätsbibliothek Mainz, 2013. http://d-nb.info/1031702806/34.
Pełny tekst źródłaKodialam, Muralidharan S. 1963. "The O-D shortest path problem and connectivity problems on periodic graphs". Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13087.
Pełny tekst źródłaSimms, Amy E. "A Stochastic Approach to Modeling Aviation Security Problems Using the KNAPSACK Problem". Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36806.
Pełny tekst źródłaMaster of Science
Huot, Annette. "Le style d'apprentissage : un outil de formation d'équipes de résolution de problèmes au niveau collégial /". Thèse, Chicoutimi : Université du Québec à Chicoutimi, 1997. http://theses.uqac.ca.
Pełny tekst źródła