Academic literature on the topic 'Problems'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Problems.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Problems"
Dubrovsky, David. "Problems with the Mind-Brain problem." Neuroscience and Neurological Surgery 6, no. 1 (January 20, 2020): 01–08. http://dx.doi.org/10.31579/2578-8868/102.
Full textKaczmarek, Bogusław. "Problems in the organization – techniques of defining the problem." Ekonomiczne Problemy Usług 122 (2016): 269–78. http://dx.doi.org/10.18276/epu.2016.122-25.
Full textOnimisi Yahaya, Mohammed. "On the Problem of Features Variability in Sequence Learning Problems." International Journal of Future Computer and Communication 4, no. 2 (April 2015): 88–92. http://dx.doi.org/10.7763/ijfcc.2015.v4.362.
Full textRamzan, Siti Hajar. "Crafting Linear Motion Problems for Problem- Based Learning Physics Classes." International Journal of Psychosocial Rehabilitation 24, no. 5 (April 20, 2020): 5426–37. http://dx.doi.org/10.37200/ijpr/v24i5/pr2020249.
Full textBuda, Stanisław. "The frame problem and problem frame." Philosophical Discourses 2 (2020): 39–51. http://dx.doi.org/10.16926/pd.2020.02.03.
Full textShipman, Harry L. "Problems, problems, problems …" Nature 317, no. 6037 (October 1985): 484. http://dx.doi.org/10.1038/317484a0.
Full textWetzel, Gregory F., and William G. Bulgren. "Problems, problems, problems …" Journal of Systems and Software 9, no. 4 (May 1989): 297–303. http://dx.doi.org/10.1016/0164-1212(89)90049-6.
Full textMoser, William O. J. "Problems, problems, problems." Discrete Applied Mathematics 31, no. 2 (April 1991): 201–25. http://dx.doi.org/10.1016/0166-218x(91)90071-4.
Full textMehedi Hasnat, Md, and Md Shamsul Hoque. "Developing Satellite Towns: A Solution to Housing Problem or Creation of New Problems." International Journal of Engineering and Technology 8, no. 1 (January 2016): 50–56. http://dx.doi.org/10.7763/ijet.2016.v6.857.
Full textMehedi Hasnat, Md, and Md Shamsul Hoque. "Developing Satellite Towns: A Solution to Housing Problem or Creation of New Problems." International Journal of Engineering and Technology 8, no. 1 (2016): 50–56. http://dx.doi.org/10.7763/ijet.2016.v8.857.
Full textDissertations / Theses on the topic "Problems"
Tautenhahn, Ulrich, Uno Hämarik, Bernd Hofmann, and 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.
Full textJones, 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.
Full textPh. D.
Sneddon, Penny L. "Sleep Problems in Young Children With and Without Behavior Problems." DigitalCommons@USU, 2007. https://digitalcommons.usu.edu/etd/6127.
Full textAli, Ismail 1961. "Uniqueness of Positive Solutions for Elliptic Dirichlet Problems." Thesis, University of North Texas, 1990. https://digital.library.unt.edu/ark:/67531/metadc330654/.
Full textQueiroz, Thiago Alves de. "Algoritmos para problemas de corte e empacotamento." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275759.
Full textTese (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.
Full textA 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.
Full textLi, 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.
Full textQiang, Feng. "Parallel problem generation for structured problems in mathematical programming." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/11688.
Full textDel, Valle Aline Marques. "Problema da mochila com itens irregulares." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275763.
Full textDissertaçã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
Books on the topic "Problems"
Competition, Canadian Mathematics, and Waterloo Mathematics Foundation, eds. Problems, problems, problems. Waterloo, Ont: University of Waterloo, Waterloo Mathematics Foundation, 1988.
Find full textKrenke, A. N. Problemy klimata =: Climatic problems. Moskva: Mezhvedomstvennyĭ geofizicheskiĭ kom-t RAN, 1992.
Find full textN, Krenke A., ed. Problemy klimata =: Climatic problems. Moskva: Mezhvedomstvennyĭ geofizicheskiĭ kom-t RAN, 1992.
Find full textill, Snider Jackie, ed. Problems! problems! Scarborough, Ont: Nelson Canada, 1991.
Find full textCompetition, Canadian Mathematics, and Waterloo Mathematics Foundation, eds. Problems, problems, problems, volume 3. Waterloo, ON: University of Waterloo, Waterloo Mathematics Foundation, 1990.
Find full textCompetition, Canadian Mathematics. Problems Problems Problems, volume 9. Waterloo, Ont: University of Waterloo. Centre for Education in Mathematics and Computing, 1988.
Find full textCompetition, Canadian Mathematics, and Waterloo Mathematics Foundation, eds. Problems, problems, problems, volume 4. Waterloo, ON: University of Waterloo, Waterloo Mathematics Foundation, 1991.
Find full textWingard-Nelson, Rebecca. Algebra word problems: No problem! Berkeley Heights, NJ: Enslow Publishers, 2011.
Find full textWingard-Nelson, Rebecca. Geometry word problems: No problem! Berkeley Heights, NJ: Enslow Publishers, 2012.
Find full textWingard-Nelson, Rebecca. Geometry word problems: No problem! Berkeley Heights, NJ: Enslow Publishers, 2011.
Find full textBook chapters on the topic "Problems"
Hicks, Michael J. "Problems, problems, problems!" In Problem Solving in Business and Management, 1–12. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4899-7148-7_1.
Full textReinders, L. J. "Problems, Problems, Problems ……" In Sun in a Bottle?... Pie in the Sky!, 147–59. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-74734-3_11.
Full textWilkinson, Tolbert S. "Problems and Problem Solving." In Circumareolar Techniques for Breast Surgery, 183–207. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-2508-9_24.
Full textKasser, Joseph Eli. "Problems and Problem-Solving." In Systemic and Systematic Risk Management, 113–68. First edition. | Boca Raton, FL : CRC Press, 2020.: CRC Press, 2020. http://dx.doi.org/10.1201/9780429025389-5.
Full textRamm, Alexander G. "Other Symmetry Problems." In Symmetry Problems. The Navier-Stokes Problem., 29–37. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-031-02415-3_4.
Full textGilhooly, Kenneth J. "Problems, Problem Solving and Creativity." In Incubation in Problem Solving and Creativity, 1–24. 1 Edition. | New York: Routledge, 2019.: Routledge, 2019. http://dx.doi.org/10.4324/9781315147611-1.
Full textKöbler, Johannes, Uwe Schöning, and Jacobo Torán. "Decision Problems, Search Problems, and Counting Problems." In The Graph Isomorphism Problem, 11–50. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0333-9_3.
Full textSkiena, Steven S. "Graph Problems: Hard Problems." In The Algorithm Design Manual, 523–61. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-84800-070-4_16.
Full textTreffinger, Donald J. "The CPS Practice Problems." In Practice Problems for Creative Problem Solving, 15–65. 3rd ed. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781003237211-3.
Full textKleinert, Ernst. "Problems." In Units in Skew Fields, 72–76. Basel: Birkhäuser Basel, 2000. http://dx.doi.org/10.1007/978-3-0348-8409-9_9.
Full textConference papers on the topic "Problems"
Cunningham, Jeanne Lee. "The problem is problems." In the 20th annual ACM SIGUCCS conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/143164.143218.
Full textPoore, A. B., N. Rijavec, M. Liggins, and V. C. Vannicola. "Data association problems posed as multidimensional assignment problems: problem formulation." In Optical Engineering and Photonics in Aerospace Sensing, edited by Oliver E. Drummond. SPIE, 1993. http://dx.doi.org/10.1117/12.157786.
Full text"Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation." In International Conference on Knowledge Engineering and Ontology Development. SCITEPRESS - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004546202530260.
Full textNguyen, Ha, Walther Caminati, Sonia Melandri, Assimo Maris, Luca Evangelisti, Wolfgang Stahl, and Lynn Ferres. "PROBLEMS, PROBLEMS, PROBLEMS: THE LONG JOURNEY OF PHENYL ACETATE." In 2022 International Symposium on Molecular Spectroscopy. Urbana, Illinois: University of Illinois at Urbana-Champaign, 2022. http://dx.doi.org/10.15278/isms.2022.ma05.
Full textBlackmon, Marilyn Hughes, Muneo Kitajima, and Peter G. Polson. "Tool for accurately predicting website navigation problems, non-problems, problem severity, and effectiveness of repairs." In the SIGCHI conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1054972.1054978.
Full textAgent, An, and Goal-Oriented Approach. "Extending Problem Frames to deal with stakeholder problems." In the 2009 ACM symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1529282.1529366.
Full textZheng, Yujun, and Jinyun Xue. "Problem Reduction Graph Model for Discrete Optimization Problems." In 2010 Third International Joint Conference on Computational Science and Optimization. IEEE, 2010. http://dx.doi.org/10.1109/cso.2010.202.
Full textMardhiah, M. Z., M. Mailizar, and E. Elizar. "Students’ mathematics problem-solving skills in PISA problems." In THE 2ND SCIENCE AND MATHEMATICS INTERNATIONAL CONFERENCE (SMIC 2020): Transforming Research and Education of Science and Mathematics in the Digital Age. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0041685.
Full textKabilov, Alisher, Sherzod Baxtiyorovich Rajabov, and Bahromjon Numanovich Urmanov. "Problem of Optimum Control Connected with Environmental Problems." In ICFNDS 2021: The 5th International Conference on Future Networks & Distributed Systems. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3508072.3508215.
Full textOsipov, Gennady Sergeyevich. "THE PLATEAU PROBLEM IN SOLVING INVERSE FUZZY PROBLEMS." In Themed collection of papers from Foreign international scientific conference «Joint innovation - joint development». by HNRI «National development» in cooperation with PS of UA. February 2024. - Cuangzhou (China). Crossref, 2024. http://dx.doi.org/10.37539/240229.2024.43.20.002.
Full textReports on the topic "Problems"
Srivastava, J. Multivariable Problems of Statistics and Problem Theory. Fort Belvoir, VA: Defense Technical Information Center, May 1985. http://dx.doi.org/10.21236/ada160347.
Full textFinsterle, S. ITOUGH2 sample problems. Office of Scientific and Technical Information (OSTI), November 1997. http://dx.doi.org/10.2172/334371.
Full textWalsh, Timothy Francis, and David Minot Day. Quadratic eigenvalue problems. Office of Scientific and Technical Information (OSTI), April 2007. http://dx.doi.org/10.2172/912651.
Full textDavidson, Eva E., Fausto Franceschini, and Kang Seog Kim. ATF Benchmark Problems. Office of Scientific and Technical Information (OSTI), August 2019. http://dx.doi.org/10.2172/1607042.
Full textFinsterle, Stefan. iTOUGH2 Sample Problems. Office of Scientific and Technical Information (OSTI), June 2002. http://dx.doi.org/10.2172/799535.
Full textMathis, James J. Solving Colombia's Problems. Fort Belvoir, VA: Defense Technical Information Center, April 2003. http://dx.doi.org/10.21236/ada415756.
Full textMorck, Randall. Generalized Agency Problems. Cambridge, MA: National Bureau of Economic Research, June 2009. http://dx.doi.org/10.3386/w15051.
Full textLawing, Chase, Scott Palmtag, and Mehdi Asgari. BWR Progression Problems. Office of Scientific and Technical Information (OSTI), February 2021. http://dx.doi.org/10.2172/1838995.
Full textKrishnaprasad, P. S. Eulerian Many-Body Problems. Fort Belvoir, VA: Defense Technical Information Center, January 1989. http://dx.doi.org/10.21236/ada444546.
Full textWhalen, D. J., D. A. Cardon, J. L. Uhle, and J. S. Hendricks. MCNP: Neutron benchmark problems. Office of Scientific and Technical Information (OSTI), November 1991. http://dx.doi.org/10.2172/10103487.
Full text