Zaloguj się

Gotowe bibliografie tematyczne / Programming (mathematics) / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Programming (mathematics).

Rozprawy doktorskie na temat „Programming (mathematics)”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 29 lipca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Programming (mathematics)”.

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.

1

Rolandsson, Jakob. "Programming as Mathematics – A Curriculum Perspective." Thesis, Uppsala universitet, Matematiska institutionen, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-451806.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Yung, Simon Yun Pui. "Definitive programming : a paradigm for exploratory programming." Thesis, University of Warwick, 1992. http://wrap.warwick.ac.uk/78859/.

Pełny tekst źródła

Streszczenie:

Exploratory software development is a method that applies to the development of programs whose requirement is initially unclear. In such a context, it is only through prototyping and experimenting on the prototypes that the requirement can be fully developed. A good exploratory software development method must have a short development cycle. This thesis describes our attempt to fulfil this demand. We address this issue in the programming language level. A novel programming paradigm - definitive (definition-based) programming - is developed. In definitive programming, a state is represented by

Style APA, Harvard, Vancouver, ISO itp.

3

Sharifi, Mokhtarian Faranak. "Mathematical programming with LFS functions." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56762.

Pełny tekst źródła

Streszczenie:

Differentiable functions with a locally flat surface (LFS) have been recently introduced and studied in convex optimization. Here we extend this motion in two directions: to non-smooth convex and smooth generalized convex functions. An important feature of these functions is that the Karush-Kuhn-Tucker condition is both necessary and sufficient for optimality. Then we use the properties of linear LFS functions and basic point-to-set topology to study the "inverse" programming problem. In this problem, a feasible, but nonoptimal, point is made optimal by stable perturbations of the parameters.

Style APA, Harvard, Vancouver, ISO itp.

4

Fuentes, Martinez Ana. "Teachers’ tactics when programming and mathematics converge." Licentiate thesis, Högskolan Väst, Avd för medier och design, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-16379.

Pełny tekst źródła

Streszczenie:

Teachers’ everyday practices are embedded in school contexts in which their teaching autonomy is constrained by rules, moral obligations, physical settings,and official directives. When a curricular revision mandated that programming was to be a part of mathematics in upper secondary education, teachers’ conditions changed. How teachers adapted to the new curriculum and how they navigated the tensions and contradictions that they encountered is in this thesis analyzed in terms of teachers’ tactics and policy strategies. The overall goal of the investigation is to contribute to a critical under

Style APA, Harvard, Vancouver, ISO itp.

5

Davidescu, Diana Maria. "Convexifiable smooth programming and applications." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82216.

Pełny tekst źródła

Streszczenie:

This thesis is an introduction to the study of convexification problems involving smooth functions in the area of continuous mathematical programming. The results are applied to a real life problem in oil production. An improved model is formulated for the company which yields environmentally friendlier optimal solutions at the same profit level.

Style APA, Harvard, Vancouver, ISO itp.

6

Reeves, Laurence H. "Mathematical Programming Applications in Agroforestry Planning." DigitalCommons@USU, 1991. https://digitalcommons.usu.edu/etd/6495.

Pełny tekst źródła

Streszczenie:

Agroforestry as a sustainable production system has been recognized as a land use system with the potential to slow encroachment of agriculture onto forested lands in developing countries. However, the acceptance of nontraditional agroforestry systems has been hampered in some areas due to the risk-averse nature of rural agriculturalists. By explicitly recognizing risk in agroforestry planning, a wider acceptance of agroforestry is possible. This thesis consists of a collection of three papers that explore the potential of modern stock portfolio theory to reduce financial risk in agroforestry

Style APA, Harvard, Vancouver, ISO itp.

7

Esche, Alexander. "Mathematical Programming and Magic| The Gathering(RTM)." Thesis, Northern Illinois University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10689404.

Pełny tekst źródła

Streszczenie:

<p> In this paper mathematical programming techniques were used to determine the optimal strategy for playing Magic: The Gathering<sup>®</sup>. Games with the cards Lightning Bolt, Mountain, and Vexing Devil were evaluated using the minimax algorithm to determine the winner when all information about the cards is assumed known to both players. Computation time was shortened through the use of an evaluation function, a random forest algorithm that had been trained on 1000 completed games. A winning percentage was established for each pair of decks where the number of creatures was less than

Style APA, Harvard, Vancouver, ISO itp.

8

Cregger, Michael L. "The general mixed-integer linear programming problem an empirical analysis /." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1993. http://www.kutztown.edu/library/services/remote_access.asp.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Trujillo-Cortez, Refugio. "LFS functions in stable bilevel programming." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ37171.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Trujillo-Cortez, Refugio. "Stable convex parametric programming and applications." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=37856.

Pełny tekst źródła

Streszczenie:

This thesis is a study of stable perturbations in convex programming models. Stability of a general model is introduced as lower semicontinuity of the feasible set mapping. This stability is shown to be equivalent to the Robinson notion of stability and regularity. In the convex case, it is also equivalent to the full-rank Slater condition. Then, the relationships between various point-to-set mappings are studied for convex models and new implications between these mappings are established. Also, local and global optimality of parameters is studied. A new result here is a characterization of l

Style APA, Harvard, Vancouver, ISO itp.

11

Sundbom, Tobias. "Mathematical programming based approaches in credit scoring." Thesis, Uppsala University, Department of Mathematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-120980.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Moor, Oege de. "Categories, relations and dynamic programming." Thesis, University of Oxford, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305600.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Nahum, Carole. "Second order sensitivity analysis in mathematical programming." Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74349.

Pełny tekst źródła

Streszczenie:

We consider a nonlinear mathematical program, with twice continuously differentiable functions.<br>If a point x$ sb0$ does not satisfy a certain Second Order Sufficient Condition (SOS) for optimality (that does not require any constraint qualification, see, e.g., BEN-ISRAEL, BEN-TAL and ZLOBEC (81)), then we prove that the knowledge of the second order properties (derivative, Hessian) of the functions is not enough to conclude that the point is optimal.<br>When the functions are continuously perturbed, what is the local behavior of an optimal solution x$ sb0$ and of the associate optimal value

Style APA, Harvard, Vancouver, ISO itp.

14

He, Fang. "Effective integrations of constraint programming, integer programming and local search for two combinatorial optimisation problems." Thesis, University of Nottingham, 2012. http://eprints.nottingham.ac.uk/14208/.

Pełny tekst źródła

Streszczenie:

This thesis focuses on the construction of effective and efficient hybrid methods based on the integrations of Constraint Programming (CP), Integer Programming (IP) and local search (LS) to tackle two combinatorial optimisation problems from different application areas: the nurse rostering problems and the portfolio selection problems. The principle of designing hybrid methods in this thesis can be described as: for the combinatorial problems to be solved, the properties of the problems are investigated firstly and the problems are decomposed accordingly in certain ways; then the suitable solu

Style APA, Harvard, Vancouver, ISO itp.

15

Kaluzny, Bohdan Lubomyr. "Linear programming : pivoting on polyhedra and arrangements." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100633.

Pełny tekst źródła

Streszczenie:

Linear programming is perhaps the most useful tool in optimization, much of it's success owed to the efficiency of the simplex method in practice --- its ability to solve problems with millions of variables with relative ease. However, whether there exists a strongly polynomial algorithm to solve linear programming remains an open question. Pivot methods, including the simplex method, remain the best hope for finding such an algorithm, despite the fact that almost all variants have been shown to require exponential time on special instances. Fundamental questions about the path length (number

Style APA, Harvard, Vancouver, ISO itp.

16

Galup, Luis Enrique. "A programming approach to ergodic maximal inequalities /." The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487944660931622.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Zhou, Fangjun. "Nonmonotone methods in optimization and DC optimization of location problems." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/21777.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Zhou, Xiaojie. "Characterizations of optimality in multi-objective programming." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61040.

Pełny tekst źródła

Streszczenie:

This thesis contains several contributions to the theory of optimality conditions in single- and multi-objective optimization. The main result provides an answer to the following, apparently open, question in mathematical welfare economics: Given a feasible decision, find a saddle-point condition which is both necessary and sufficient that the decision is Pareto optimal for convex objectives and convex constraints. This result is then extended to convex multi-objective parametric optimization and to a large class of nonconvex multi-objective programs.

Style APA, Harvard, Vancouver, ISO itp.

19

Loucopoulos, Constantine. "Mathematical Programming Approaches to the Three-Group Classification Problem." Thesis, University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc279363/.

Pełny tekst źródła

Streszczenie:

In the last twelve years there has been considerable research interest in mathematical programming approaches to the statistical classification problem, primarily because they are not based on the assumptions of the parametric methods (Fisher's linear discriminant function, Smith's quadratic discriminant function) for optimality. This dissertation focuses on the development of mathematical programming models for the three-group classification problem and examines the computational efficiency and classificatory performance of proposed and existing models. The classificatory performance of these

Style APA, Harvard, Vancouver, ISO itp.

20

Borg, Andreas. "Designing for the incorporation of programming in mathematical education : Programming as an instrument for mathematical problem solving." Licentiate thesis, Karlstads universitet, Institutionen för pedagogiska studier (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-85625.

Pełny tekst źródła

Streszczenie:

This study explored Swedish upper secondary school students’ use of programming for mathematical purposes. The aim of the study was to investigate the process through which students learn how to use a programming environment as a technical artefact during mathematical problem solving and how the orchestration of such learning situations could facilitate this process. In order to study the students’ use of the programming environment, design-based research was used as the main methodological approach. The design involved the development of specific mathematical tasks to be tried out with studen

Style APA, Harvard, Vancouver, ISO itp.

21

Wei, Hua. "Numerical Stability in Linear Programming and Semidefinite Programming." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2922.

Pełny tekst źródła

Streszczenie:

We study numerical stability for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. <br /><br /> We start with the error bound analysis of the search directions for the normal equation approach for LP. Our error analysis explains the surprising fact that the ill-conditioning is not a significant problem for the normal equation system. We also explain why most of the popular LP solvers have a default stop tolerance of only 10<sup>-8</sup> when the

Style APA, Harvard, Vancouver, ISO itp.

22

Steffy, Daniel E. "Topics in exact precision mathematical programming." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39639.

Pełny tekst źródła

Streszczenie:

The focus of this dissertation is the advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can return suboptimal or incorrect resulting because of round-off errors or the use of numerical tolerances. Exact or correct results are necessary for some applications. Implementing software entirely in rational arithmetic can be prohibitively slow. A viable alternative is the use of hybrid methods that use fast numerical computation to obtain approximate results that are then verified or corrected with s

Style APA, Harvard, Vancouver, ISO itp.

23

Leong, Fu Fai. "Application of linear programming in Sudoku." Thesis, University of Macau, 2006. http://umaclib3.umac.mo/record=b1636813.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Pudwill, Rodger A. "An investigation of an exterior point method for linear programming." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/24506.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Silva, Robert A. "Optimizing multi-ship, multi-mission operational planning for the Joint Force Maritime Component Commander." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Mar/09Mar%5FSilva.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 2009.<br>Thesis Advisor(s): Carlyle, W. Matthew. "March 2009." Description based on title screen as viewed on April 24, 2009. Author(s) subject terms: Integer Programming, Operational Planning, Navy Mission Planner, Navy Asset-Mission Pairing, Maritime Headquarters, Maritime Operations Center, Constrained Enumeration, Stack-based Enumeration, Mathematical Programming, Optimization, Decision Aid, Planning Tool, Ship Employment Schedule. Includes bibliographical references (p. 61-62). Also available in print.

Style APA, Harvard, Vancouver, ISO itp.

26

Hewitt, Michael R. "Integer programming based search." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31641.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Erera, Martin; Committee Chair: Nemhauser, George; Committee Chair: Savelsbergh, Martin; Committee Member: Ergun, Ozlem; Committee Member: Ferguson, Mark. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Style APA, Harvard, Vancouver, ISO itp.

27

Easton, Kelly King. "Using integer programming and constraint programming to solve sports scheduling problems." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/25795.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Szularz, Marek. "Quadratic programming with constant norm with parallel applications." Thesis, Kingston University, 1991. http://eprints.kingston.ac.uk/20556/.

Pełny tekst źródła

Streszczenie:

This thesis is concerned with the problem of minimizing a quadratic function defined on an ellipsoid, and subject to the set of linear inequality constraints. An original method is proposed, a method which generates the descent flow on the spiral, the curve on the surface of the constraining ellipsoid, characterized locally by the steepest descent of the objective function. The spiral is constructed discretely in a number of points which are the solutions of the sequence of certain artificially constrained subproblems. The properties of the spiral are studied extensively to show that the assoc

Style APA, Harvard, Vancouver, ISO itp.

29

Rubalcaba, Roberto Ramon Johnson Peter D. "Fractional domination, fractional packings, and fractional isomorphisms of graphs." Auburn, Ala., 2005. http://repo.lib.auburn.edu/EtdRoot/2005/SPRING/Mathematics/Dissertation/RUBALCABA_ROBERT_56.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Staats, Kai. "Genetic programming applied to RFI mitigation in radio astronomy." Master's thesis, University of Cape Town, 2016. http://hdl.handle.net/11427/23703.

Pełny tekst źródła

Streszczenie:

Genetic Programming is a type of machine learning that employs a stochastic search of a solutions space, genetic operators, a fitness function, and multiple generations of evolved programs to resolve a user-defined task, such as the classification of data. At the time of this research, the application of machine learning to radio astronomy was relatively new, with a limited number of publications on the subject. Genetic Programming had never been applied, and as such, was a novel approach to this challenging arena. Foundational to this body of research, the application Karoo GP was developed i

Style APA, Harvard, Vancouver, ISO itp.

31

Benson, Carol Trinko Plantholt Michael. "Effect of computer instruction in finite mathematics on student achievement and attitude." Normal, Ill. Illinois State University, 1989. http://wwwlib.umi.com/cr/ilstu/fullcit?p9004078.

Pełny tekst źródła

Streszczenie:

Thesis (D.A.)--Illinois State University, 1989.<br>Title from title page screen, viewed October 14, 2005. Dissertation Committee: Michael J. Plantholt (chair), John A. Dossey, Patricia H. Klass, James T. Parr, Lawrence E. Spence. Includes bibliographical references (leaves 87-89) and abstract. Also available in print.

Style APA, Harvard, Vancouver, ISO itp.

32

Hearnes, Warren E. II. "Near-optimal intelligent control for continuous set-point regulator problems via approximate dynamic programming." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/24882.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Wang, Xianzhi. "Resolution of Ties in Parametric Quadratic Programming." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1199.

Pełny tekst źródła

Streszczenie:

We consider the convex parametric quadratic programming problem when the end of the parametric interval is caused by a multiplicity of possibilities ("ties"). In such cases, there is no clear way for the proper active set to be determined for the parametric analysis to continue. In this thesis, we show that the proper active set may be determined in general by solving a certain non-parametric quadratic programming problem. We simplify the parametric quadratic programming problem with a parameter both in the linear part of the objective function and in the right-hand side of the constrain

Style APA, Harvard, Vancouver, ISO itp.

34

Violin, Alessia. "Mathematical programming approaches to pricing problems." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209173.

Pełny tekst źródła

Streszczenie:

There are many real cases where a company needs to determine the price of its products so as to maximise its revenue or profit.<p>To do so, the company must consider customers' reactions to these prices, as they may refuse to buy a given product or service if its price is too high. This is commonly known in literature as a pricing problem.<p>This class of problems, which is typically bilevel, was first studied in the 1990s and is NP-hard, although polynomial algorithms do exist for some particular cases. Many questions are still open on this subject.<p><p>The aim of this thesis is to investiga

Style APA, Harvard, Vancouver, ISO itp.

35

Pfeiff, Daniel M. "Optimizing employment of search platforms to counter self-propelled semi-submersibles." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Jun/09Jun%5FPfeiff.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, June 2009.<br>Thesis Advisor(s): Brown, Gerald G. "June 2009." Description based on title screen as viewed on July 14, 2009. Author(s) subject terms: Optimization, Mathematical Programming, Semi-Submersibles, Search and Detection, Defender-Attacker Optimization. Includes bibliographical references (p. 71-72). Also available in print.

Style APA, Harvard, Vancouver, ISO itp.

36

Kim, Chiheon. "Statistical limits of graphical channel models and a semidefinite programming approach." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120659.

Pełny tekst źródła

Streszczenie:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 205-213).<br>Community recovery is a major challenge in data science and computer science. The goal in community recovery is to find the hidden clusters from given relational data, which is often represented as a labeled hyper graph where nodes correspond to items needing to be labeled and edges correspond to observed relations between the items. We investigate the problem of exact recovery in the class of statistical mod

Style APA, Harvard, Vancouver, ISO itp.

37

Srinivasan, Subhashini. "Modeling the Homeschool timetabling problem using Integer programming." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2555.

Pełny tekst źródła

Streszczenie:

Home schooling has steadily been increasing in the past decade. According to a survey in 2007, about 2.5 million children were being home schooled in the US. Typically, parents provide education at the convenience of their home and in some cases an instructor is appointed for the same. The Home School Timetabling problem (HSTP) deals with assigning subjects, timeslots and rooms to every student. In doing so, there are certain hard and specialty constraints that are to be satisfied. Integer programming (IP) has been used in solving the HSTP as it has the advantage of being able to provide info

Style APA, Harvard, Vancouver, ISO itp.

38

Petcharawises, Thavisakdi. "Programming language as a tool for software design." DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1985. http://digitalcommons.auctr.edu/dissertations/2471.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Zaibidi, Nerda Zura. "Modelling human fairness in cooperative games : a goal programming approach." Thesis, University of Portsmouth, 2012. https://researchportal.port.ac.uk/portal/en/theses/modelling-human-fairness-in-cooperative-games(4c3d0987-0edc-45be-9c4b-b1114df6bb3e).html.

Pełny tekst źródła

Streszczenie:

The issues of rationality in human behavior and fairness in cooperation have gained interest in various economic studies. In many prescriptive models of games, rationality of human decision makers implicitly assumes exchange-ability. This means that real people are assumed to adopt the beliefs of a player as expressed in the game when placed in the shoes of that particular player. However, it is a well debated topic in the literature that this modeling assumption is not in accordance to what behavioral economists have observed in some games played with real human subjects. Even when assuming t

Style APA, Harvard, Vancouver, ISO itp.

40

Colombo, Marco. "Advances in interior point methods for large-scale linear programming." Thesis, University of Edinburgh, 2007. http://hdl.handle.net/1842/2488.

Pełny tekst źródła

Streszczenie:

This research studies two computational techniques that improve the practical performance of existing implementations of interior point methods for linear programming. Both are based on the concept of symmetric neighbourhood as the driving tool for the analysis of the good performance of some practical algorithms. The symmetric neighbourhood adds explicit upper bounds on the complementarity pairs, besides the lower bound already present in the common N−1 neighbourhood. This allows the algorithm to keep under control the spread among complementarity pairs and reduce it with the barrier paramete

Style APA, Harvard, Vancouver, ISO itp.

41

Sadones, Sylvie. "A new two-phase heuristic for two-dimensional rectangular bin-packing and strip-packing /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66036.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Smith, Michael Anthony. "Embedding an object calculus in the unifying theories of programming." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:8b5be90d-59c1-42c0-a996-ecd8015097b3.

Pełny tekst źródła

Streszczenie:

Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relational predicates. This theory is intended to provide a single framework in which any programming paradigms, languages, and features, can be modelled, compared and contrasted. The UTP already has models for several programming formalisms, such as imperative programming, higher-order programming (e.g. programing with procedures), several styles of concurrent programming (or reactive systems), class-based object-orientation, and transaction processing. We believe that the UTP ought to be able to repres

Style APA, Harvard, Vancouver, ISO itp.

43

Dong, Hongbo. "Copositive programming: separation and relaxations." Diss., University of Iowa, 2011. https://ir.uiowa.edu/etd/2692.

Pełny tekst źródła

Streszczenie:

A large portion of research in science and engineering, as well as in business, concerns one similar problem: how to make things "better”? Once properly modeled (although usually a highly nontrivial task), this kind of questions can be approached via a mathematical optimization problem. Optimal solution to a mathematical optimization problem, when interpreted properly, might corresponds to new knowledge, effective methodology or good decisions in corresponding application area. As already proved in many success stories, research in mathematical optimization has a significant impact on numerous

Style APA, Harvard, Vancouver, ISO itp.

44

Richard, Jean-Philippe P. "Lifted inequalities for 0-1 mixed integer programming." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/24590.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Bu, Honggang. "Scheduling Smart Home Appliances using Goal Programming with Priority." Thesis, North Dakota State University, 2016. https://hdl.handle.net/10365/28266.

Pełny tekst źródła

Streszczenie:

Driven by the advancement of smart electrical grid technologies, automated home energy management systems are being increasingly and extensively studied, developed, and widely accepted. A system like this is indispensable for and symbolic of a smart home. Mixed integer linear programming (MILP) together with dynamic electricity tariff and smart home appliances is a common way to developing energy management systems capable of automatically scheduling appliance operation and greatly saving monetary cost. This study transformed an existing plain MILP model to a goal programming model with priori

Style APA, Harvard, Vancouver, ISO itp.

46

Ginn, Isabella Brooke. "Integer Programming With Groebner Basis." VCU Scholars Compass, 2007. http://scholarscompass.vcu.edu/etd/769.

Pełny tekst źródła

Streszczenie:

Integer Programming problems are difficult to solve. The goal is to find an optimal solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The Algorithms are The Conti-Traverso Algorithm and the Original Conti-Traverso Algorithm. Examples are given as well as proofs that correspond to the algorithms. The latter algorithm is more efficient as well as user friendly. The algorithms are not necessarily the best way to solve and integer

Style APA, Harvard, Vancouver, ISO itp.

47

Valiron, Benoit. "A functional programming language for quantum computation with classical control." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26790.

Pełny tekst źródła

Streszczenie:

The objective of this thesis is to develop a functional programming language for quantum computers based on the QRAM model, following the work of P. Selinger (2004) on quantum flow-charts. We construct a lambda-calculus without side-effects to deal with quantum bits. We equip this calculus with a probabilistic call-by-value operational semantics. Since quantum information cannot be duplicated due to the no-cloning property, we need a resource-sensitive type system. We develop it based on affine intuitionistic linear logic. Unlike the quantum lambda-calculus proposed by Van Tonder (2003, 2004),

Style APA, Harvard, Vancouver, ISO itp.

48

Bengtsson, Maja. "Att undervisa i programmering utan programmeringsutbildning.En intervjustudie hur lärare utan utbildning i programmering implementerar programmering i sin undervisning." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-92897.

Pełny tekst źródła

Streszczenie:

In the fall of 2018, programming was implemented in the swedish curriculum and then became a new element in mathematics education for grades 1-3. Teachers who took their degree before the implementation, lacks education in programming and there is interest in finding out how teaching about programming is conducted since it became part of the curriculum. The purpose of this study was to contribute with knowledge about how teachers have implemented programming in their teaching even though they lack education in it. Four semi-structured interviews have been conducted where the data from the inte

Style APA, Harvard, Vancouver, ISO itp.

49

de, Castro Christopher H. "Assessing the Impact of Computer Programming in Understanding Limits and Derivatives in a Secondary Mathematics Classroom." Digital Archive @ GSU, 2011. http://digitalarchive.gsu.edu/msit_diss/79.

Pełny tekst źródła

Streszczenie:

This study explored the development of student’s conceptual understanding of limit and derivative when specific computational tools were utilized. Fourteen students from a secondary Advanced Placement Calculus AB course explored the limit and derivative concepts from calculus using computational tools in the Maple computer algebra system. Students worked in pairs utilizing the pair-programming collaborative model. Four groups of student pairs constructed computational tools and used them to explore the limit and derivative concepts. The remaining four student pairs were provided similar tools

Style APA, Harvard, Vancouver, ISO itp.

50

Fukasawa, Ricardo. "Single-row mixed-integer programs : theory and computations /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24660.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.<br>Committee Chair: William J. Cook; Committee Member: Ellis Johnson; Committee Member: George Nemhauser; Committee Member: Robin Thomas; Committee Member: Zonghao Gu

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!