Sökning: "Solving"
Visar resultat 1 - 5 av 2933 uppsatser innehållade ordet Solving.
1. Hur påverkas elevers förståelse för multiplikation av areamodeller som representation? En designstudie i en grekisk grundskola med elever i Åk 2, där undervisningsprocessen fokuserar multiplikativt tänkande samt kommutativa lagen för multiplikation
Master-uppsats, Göteborgs universitet/Institutionen för didaktik och pedagogisk professionSammanfattning : This design study explores the use of the area model as a representation of multiplication, providing opportunities for second school grade pupils to develop an understanding of multiplication and build multiplicative thinking. Furthermore, the study aims to give pupils the opportunity to discover the commutative law of multiplication with the help of the area model. LÄS MER
2. Exploring the Integration of Artificial Intelligence Tools in English as a Foreign Language (EFL) Pedagogy. A Literature Review
Uppsats för yrkesexamina på grundnivå, Göteborgs universitet / LärarutbildningsnämndenSammanfattning : The introduction of artificial intelligence (AI) tools in schools has sparked a polarised debate about its negative impact on critical thinking, plagiarism, and problem-solving skills. Future educators will be affected by the tools, prompting this thesis to explore their potential benefits and challenges through a literature review. LÄS MER
3. Finite element density functional description of linear molecules
Kandidat-uppsats, Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)Sammanfattning : This report describes a project performed at Linnaeus University with the task of solving the Schrodinger equation for electrons in homonuclear diatomic molecules, using the finite element method in Python. The Schrodinger equation is solved for the hydrogen atom, nitrogen atom, hydrogen molecule and nitrogen molecule using a finite element method. LÄS MER
4. A Verified QBF Solver
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Quantified Boolean Formulas (QBFs) extend propositional logic with universal and existential quantification over Boolean variables. A QBF is satisfiable if and only if there is an assignment of Boolean values to the free variables that makes the formula true, and a QBF solver is a software tool determining if a given QBF is satisfiable. LÄS MER
5. Station-level demand prediction in bike-sharing systems through machine learning and deep learning methods
Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskapSammanfattning : Public Bike-Sharing systems have been employed in many cities around the globe. Shared bikes are an efficient and convenient means of transportation in advanced societies. Nonetheless, station planning and local bike-sharing network effectiveness can be challenging. LÄS MER