Einloggen

Thematische Bibliographien / Programming functions / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Programming functions.

Dissertationen zum Thema „Programming functions“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 29. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Programming functions" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Christiansen, Jan [Verfasser]. "Investigating Minimally Strict Functions in Functional Programming / Jan Christiansen." Kiel : Universitätsbibliothek Kiel, 2012. http://d-nb.info/1024079805/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Ahluwalia, Manu. "Co-evolving functions in genetic programming." Thesis, University of the West of England, Bristol, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322427.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Stark, Ian David Bede. "Names and higher-order functions." Thesis, University of Cambridge, 1994. https://www.repository.cam.ac.uk/handle/1810/251879.

Der volle Inhalt der Quelle

Annotation:

Many functional programming languages rely on the elimination of 'impure' features: assignment to variables, exceptions and even input/output. But some of these are genuinely useful, and it is of real interest to establish how they can be reintroducted in a controlled way. This dissertation looks in detail at one example of this: the addition to a functional language of dynamically generated names. Names are created fresh, they can be compared with each other and passed around, but that is all. As a very basic example of state, they capture the graduation between private and public, local and

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Shapiro, David. "Compiling Evaluable Functions in the Godel Programming Language." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5101.

Der volle Inhalt der Quelle

Annotation:

We present an extension of the Godel logic programming language code generator which compiles user-defined functions. These functions may be used as arguments in predicate or goal clauses. They are defined in extended Godel as rewrite rules. A translation scheme is introduced to convert function definitions into predicate clauses for compilation. This translation scheme and the compilation of functional arguments both employ leftmost-innermost narrowing. As function declarations are indistinguishable from constructor declarations, a function detection method is implemented. The ultimate goal o

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Edwards, Teresa Dawn. "The box method for minimizing strictly convex functions over convex sets." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/30690.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Chen, Jein-Shan. "Merit functions and nonsmooth functions for the second-order cone complementarity problem /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/5782.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Ferris, Michael Charles. "Weak sharp minima and penalty functions in mathematical programming." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292969.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Schanzer, Emmanuel Tanenbaum. "Algebraic Functions, Computer Programming, and the Challenge of Transfer." Thesis, Harvard University, 2015. http://nrs.harvard.edu/urn-3:HUL.InstRepos:16461037.

Der volle Inhalt der Quelle

Annotation:

Students' struggles with algebra are well documented. Prior to the introduction of functions, mathematics is typically focused on applying a set of arithmetic operations to compute an answer. The introduction of functions, however, marks the point at which mathematics begins to focus on building up abstractions as a way to solve complex problems. A common refrain about word problems is that “the equations are easy to solve - the hard part is setting them up!” A student of algebra is asked to identify functional relationships in the world around them - to set up the equations that describe a sy

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

How, Tia Wah King Sing. "Fault coupling in finite functions." Thesis, London South Bank University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.261314.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Sibson, Keith. "Programming language abstractions for the global network." Thesis, University of Glasgow, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368587.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Jones, Julia E. "Microcomputer programming package for the assessment of multiattribute value functions." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/51893.

Der volle Inhalt der Quelle

Annotation:

Research into multiattribute utility theory far outweighs current attempts to apply findings, while the need for usable decision techniques continues to increase. Current decision maker - analyst procedures involving decision making sessions and numerous manual calculations are considered to be overly time-consuming, except for the most important of complex decisions. The purpose of this thesis was to design and develop a microcomputer package utilizing recent improvements in decision theory to increase the efficiency of the decision making process. Algorithms for independence testing and pa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Daniels, Anthony Charles. "A semantics for functions and behaviours." Thesis, University of Kent, 1999. https://kar.kent.ac.uk/21730/.

Der volle Inhalt der Quelle

Annotation:

The functional animation language Fran allows animations to be programmed in a novel way. Fran provides an abstract datatype of ``behaviours'' that represent time varying values such as the position of moving objects, together with a simple set of operators for constructing behaviours. More generally, this approach has potential for other kinds of real-time systems that consist of interactive components that evolve over time. We introduce a small functional language, CONTROL, which has behaviours and operators that are similar to those in Fran. Our language improves on Fran in certain key area

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Hamdan, Mohammad M. "A combinational framework for parallel programming using algorithmic skeletons." Thesis, Heriot-Watt University, 2000. http://hdl.handle.net/10399/567.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Lewis, Ian. "PrologPF : parallel logic and functions on the Delphi machine." Thesis, University of Cambridge, 1998. https://www.repository.cam.ac.uk/handle/1810/221792.

Der volle Inhalt der Quelle

Annotation:

PrologPF is a parallelising compiler targeting a distributed system of general purpose workstations connected by a relatively low performance network. The source language extends standard Prolog with the integration of higher-order functions. The execution of a compiled PrologPF program proceeds in a similar manner to standard Prolog, but uses oracles in one of two modes. An oracle represents the sequence of clauses used to reach a given point in the problem search tree, and the same PrologPF executable can be used to build oracles, or follow oracles previously generated. The parallelisation s

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Lin, Chin-Yee. "Interior point methods for convex optimization." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/15044.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Tanksley, Latriece Y. "Interior point methods and kernel functions of a linear programming problem." Click here to access thesis, 2009. http://www.georgiasouthern.edu/etd/archive/spring2009/latriece_y_tanksley/tanksley_latriece_y_200901_ms.pdf.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.)--Georgia Southern University, 2009.<br>"A thesis submitted to the Graduate Faculty of Georgia Southern University in partial fulfillment of the requirements for the degree Master of Science." Directed by Goran Lesaja. ETD. Includes bibliographical references (p. 76) and appendices.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Vorvick, Janet. "Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5195.

Der volle Inhalt der Quelle

Annotation:

The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Godel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Godel parser which enables the parsing of evaluable functions in Godel. As the first part of an extended Godel, the parser produces output similar to the output from the original Godel parser, ensuring that Godel modules are properly handled by the extended-Godel parser. Parser output is structured to

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Jung, Hoon. "Optimal inventory policies for an economic order quantity models under various cost functions /." free to MU campus, to others for purchase, 2001. http://wwwlib.umi.com/cr/mo/fullcit?p3012983.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Marinósson, Sigurour Freyr. "Stability analysis of nonlinear systems with linear programming a Lyapunov functions based approach /." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=982323697.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Otero, Fernando E. B. "New ant colony optimisation algorithms for hierarchial classification of protein functions." Thesis, University of Kent, 2010. http://www.cs.kent.ac.uk/pubs/2010/3057.

Der volle Inhalt der Quelle

Annotation:

Ant colony optimisation (ACO) is a metaheuristic to solve optimisation problems inspired by the foraging behaviour of ant colonies. It has been successfully applied to several types of optimisation problems, such as scheduling and routing, and more recently for the discovery of classification rules. The classification task in data mining aims at predicting the value of a given goal attribute for an example, based on the values of a set of predictor attributes for that example. Since real-world classification problems are generally described by nominal (categorical or discrete) and continuous (

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Vandenbussche, Dieter. "Polyhedral approaches to solving nonconvex quadratic programs." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23385.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Gatica, Ricardo A. "A binary dynamic programming problem with affine transitions and reward functions : properties and algorithm." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/32839.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Olivier, Hannes Friedel. "The expected runtime of the (1+1) evolutionary algorithm on almost linear functions." Virtual Press, 2006. http://liblink.bsu.edu/uhtbin/catkey/1356253.

Der volle Inhalt der Quelle

Annotation:

This Thesis expands the theoretical research done in the area of evolutionary algorithms. The (1+1)EA is a simple algorithm which allows to gain some insight in the behaviour of these randomized search heuristics. This work shows ways to possible improve on existing bounds. The general good runtime of the algorithm on linear functions is also proven for classes of quadratic functions. These classes are defined by the relative size of the quadratic and the linear weights. One proof of the paper looks at a worst case algorithm which always shows a worst case behaviour than many other functions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Vargyas, Emese Tünde. "Duality for convex composed programming problems." Doctoral thesis, Universitätsbibliothek Chemnitz, 2004. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200401793.

Der volle Inhalt der Quelle

Annotation:

The goal of this work is to present a conjugate duality treatment of composed programming as well as to give an overview of some recent developments in both scalar and multiobjective optimization. In order to do this, first we study a single-objective optimization problem, in which the objective function as well as the constraints are given by composed functions. By means of the conjugacy approach based on the perturbation theory, we provide different kinds of dual problems to it and examine the relations between the optimal objective values of the duals. Given some additional assumptions, we

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Hall, Bryan, University of Western Sydney, and of Science Technology and Environment College. "Energy and momentum conservation in Bohm's Model for quantum mechanics." THESIS_CSTE_XXX_Hall_B.xml, 2004. http://handle.uws.edu.au:8081/1959.7/717.

Der volle Inhalt der Quelle

Annotation:

Bohm's model for quantum mechanics is examined and a well-known drawback of the model is considered, namely the fact that the model does not conserve energy and momentum.It is shown that the Lagrangian formalism and the use of energy-momentum tensors provide a way of addressing this non-conservation aspect once the model is considered from the point of view of an interacting particle-field system. The full mathematical formulation that is then presented demonstrates that conservation can be reintroduced without disrupting the present agreement of Bohm's model with experiment.<br>Doctor of Phil

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Gerard, Ulysse. "Computing with relations, functions, and bindings." Thesis, Institut polytechnique de Paris, 2019. http://www.theses.fr/2019IPPAX005.

Der volle Inhalt der Quelle

Annotation:

Cette thèse s'inscrit dans la longue tradition de l'étude des relations entre logique mathématique et calcul et plus spécifiquement de la programmation déclarative. Le document est divisé en deux contributions principales. Chacune d'entre-elles utilise des résultats récents de la théorie de la démonstration pour développer de techniques novatrices utilisant déduction logique et fonctions pour effectuer des calculs. La première contribution de ce travail consiste en la description et la formalisation d'une nouvelle technique utilisant le mécanisme de la focalisation (un moyen de guider la reche

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Arvidsson, Staffan. "Actors and higher order functions : A Comparative Study of Parallel Programming Language Support for Bioinformatics." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-242739.

Der volle Inhalt der Quelle

Annotation:

Parallel programming can sometimes be a tedious task when dealing with problems like race conditions and synchronization. Functional programming can greatly reduce the complexity of parallelization by removing side effects and variables, eliminating the need for locks and synchronization. This thesis assesses the applicability of functional programming and the actor model using the field of bioinformatics as a case study, focusing on genome assembly. Functional programming is found to provide parallelization at a high abstraction level in some cases, but in most of the program there is no way

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Coffin, Lorraine. "The effect of hemisphericity and field dependence on performance on a programming task /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59249.

Der volle Inhalt der Quelle

Annotation:

This study investigated the effects of hemisphericity and field dependence on programming skills. Twenty-five undergraduate university students from two introductory Logo programming courses completed the study. Results suggested that hemisphericity is related to the complexity of program structure (tree depth). Supplementary analyses indicated a negative correlation between previous programming experience and the use of recursion. Implications for education and suggestions for further research are discussed, and specific implications regarding the teaching of Logo are given.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Hall, Bryan. "Energy and momentum conservation in Bohm's Model for quantum mechanics." Thesis, View thesis, 2004. http://handle.uws.edu.au:8081/1959.7/717.

Der volle Inhalt der Quelle

Annotation:

Bohm's model for quantum mechanics is examined and a well-known drawback of the model is considered, namely the fact that the model does not conserve energy and momentum.It is shown that the Lagrangian formalism and the use of energy-momentum tensors provide a way of addressing this non-conservation aspect once the model is considered from the point of view of an interacting particle-field system. The full mathematical formulation that is then presented demonstrates that conservation can be reintroduced without disrupting the present agreement of Bohm's model with experiment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Altner, Douglas S. "Advancements on problems involving maximum flows." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24828.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008.<br>Committee Chair: Ozlem Ergun; Committee Member: Dana Randall; Committee Member: Joel Sokol; Committee Member: Shabbir Ahmed; Committee Member: William Cook.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Hall, Bryan. "Energy and momentum conservation in Bohm's Model for quantum mechanics." View thesis, 2004. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20040507.155043/index.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Lin, Chungping. "The RMT (Recursive multi-threaded) tool: A computer aided software engineeering tool for monitoring and predicting software development progress." CSUSB ScholarWorks, 1998. https://scholarworks.lib.csusb.edu/etd-project/1787.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Barry, Bobbi J. "Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/4915.

Der volle Inhalt der Quelle

Annotation:

A programming language that combines the best aspects of both the functional and logic paradigms with a complete evaluation strategy has been a goal of a Portland State University project team for the last several years. I present the third in a series of modifications to the compiler of the logic programming language Goedel which reaches this goal. This enhancement of Goedel's compiler translates user-defined functions in the form of rewrite rules into code that performs evaluation of these functions by the strategy of needed narrowing. In addition, Goedel's mechanism that evaluates predicate

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Bradley, Jay. "Reinforcement learning for qualitative group behaviours applied to non-player computer game characters." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4784.

Der volle Inhalt der Quelle

Annotation:

This thesis investigates how to train the increasingly large cast of characters in modern commercial computer games. Modern computer games can contain hundreds or sometimes thousands of non-player characters that each should act coherently in complex dynamic worlds, and engage appropriately with other non-player characters and human players. Too often, it is obvious that computer controlled characters are brainless zombies portraying the same repetitive hand-coded behaviour. Commercial computer games would seem a natural domain for reinforcement learning and, as the trend for selling games bas

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Harper, Robin Thomas Ross Computer Science &amp Engineering Faculty of Engineering UNSW. "Enhancing grammatical evolution." Awarded by:University of New South Wales. Computer Science & Engineering, 2010. http://handle.unsw.edu.au/1959.4/44843.

Der volle Inhalt der Quelle

Annotation:

Grammatical Evolution (GE) is a method of utilising a general purpose evolutionary algorithm to ???evolve??? programs written in an arbitrary BNF grammar. This thesis extends GE as follows: GE as an extension of Genetic Programming (GP) A novel method of automatically extracting information from the grammar is introduced. This additional information allows the use of GP style crossover which in turn allows GE to perform identically to a strongly typed GP system as well as a non-typed (or canonical) GP system. Two test problems are presented one which is more easily solved by the GP style cros

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

RODRIGUES, JUNIOR ORLANDO. "Aplicacao de modelos metabolicos para a determinacao de funcoes de excrecao e retencao." reponame:Repositório Institucional do IPEN, 1994. http://repositorio.ipen.br:8080/xmlui/handle/123456789/10344.

Der volle Inhalt der Quelle

Annotation:

Made available in DSpace on 2014-10-09T12:37:35Z (GMT). No. of bitstreams: 0<br>Made available in DSpace on 2014-10-09T14:03:23Z (GMT). No. of bitstreams: 1 02232.pdf: 3951264 bytes, checksum: dbd0c0050958a2578e3ec58da9f6ac83 (MD5)<br>Dissertacao (Mestrado)<br>IPEN/D<br>Instituto de Pesquisas Energeticas e Nucleares - IPEN/CNEN-SP

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Akteke-ozturk, Basak. "New Approaches To Desirability Functions By Nonsmooth And Nonlinear Optimization." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612649/index.pdf.

Der volle Inhalt der Quelle

Annotation:

Desirability Functions continue to attract attention of scientists and researchers working in the area of multi-response optimization. There are many versions of such functions, differing mainly in formulations of individual and overall desirability functions. Derringer and Suich&rsquo<br>s desirability functions being used throughout this thesis are still the most preferred ones in practice and many other versions are derived from these. On the other hand, they have a drawback of containing nondifferentiable points and, hence, being nonsmooth. Current approaches to their optimization, which a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Lee, Robert. "Teaching Algebra through Functional Programming:An Analysis of the Bootstrap Curriculum." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3519.

Der volle Inhalt der Quelle

Annotation:

Bootstrap is a computer-programming curriculum that teaches students to program video games using Racket, a functional programming language based on algebraic syntax. This study investigated the relationship between learning to program video games from a Bootstrap course and the resulting effect on students' understanding of algebra. Courses in three different schools, lasting about six weeks each, were studied. Control and treatment groups were given a pre and post algebra assessment. A qualitative component consisting of observations and interviews was also used to further triangulate findin

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Durier, Adrien. "Unique solution techniques for processes and functions." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN016.

Der volle Inhalt der Quelle

Annotation:

La méthode de preuve par bisimulation est un pilier de la théorie de la concurrence et des langages de programmation. Cette technique permet d’établir que deux programmes, ou deux protocoles distribués, sont égaux, au sens où l’on peut substituer l’un par l’autre sans affecter le comportement global du système. Les preuves par bisimulation sont souvent difficiles et techniquement complexes. De ce fait, diverses techniques ont été proposées pour faciliter de telles preuve. Dans cette thèse, nous étudions une telle technique de preuve pour la bisimulation, fondée sur l’unicité des solutions d’éq

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Potaptchik, Marina. "Portfolio Selection Under Nonsmooth Convex Transaction Costs." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2940.

Der volle Inhalt der Quelle

Annotation:

We consider a portfolio selection problem in the presence of transaction costs. Transaction costs on each asset are assumed to be a convex function of the amount sold or bought. This function can be nondifferentiable in a finite number of points. The objective function of this problem is a sum of a convex twice differentiable function and a separable convex nondifferentiable function. We first consider the problem in the presence of linear constraints and later generalize the results to the case when the constraints are given by the convex piece-wise linear functions. <br /><br /

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Cheon, Myun-Seok. "Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming." Diss., Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-04152005-130317/unrestricted/Cheon%5FMyunSeok%5F200505%5Fphd.pdf.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Industrial & Systems Engineering, Georgia Institute of Technology, 2005.<br>Barnes, Earl, Committee Member ; Shapiro, Alex, Committee Member ; Realff, Matthew, Committee Member ; Al-Khayyal, Faiz, Committee Chair ; Ahmed, Shabbir, Committee Co-Chair. Includes bibliographical references.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Widera, Paweł. "Automated design of energy functions for protein structure prediction by means of genetic programming and improved structure similarity assessment." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/11394/.

Der volle Inhalt der Quelle

Annotation:

The process of protein structure prediction is a crucial part of understanding the function of the building blocks of life. It is based on the approximation of a protein free energy that is used to guide the search through the space of protein structures towards the thermodynamic equilibrium of the native state. A function that gives a good approximation of the protein free energy should be able to estimate the structural distance of the evaluated candidate structure to the protein native state. This correlation between the energy and the similarity to the native is the key to high quality pre

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Reinke, Claus [Verfasser]. "Functions, Frames, and Interactions-completing a lambda-calculus-based purely functional language with respect to programming-in-the-large and interactions with runtime environments / Claus Reinke." Kiel : Universitätsbibliothek Kiel, 1998. http://d-nb.info/1080332626/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Basnayaka, Punya A. "Low-Level Programming of a 9-Degree-of-Freedom Wheelchair-Mounted Robotic Arm with the Application of Different User Interfaces." Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1570.

Der volle Inhalt der Quelle

Annotation:

Implementation of C++ and Matlab based control of University of South Florida's latest wheelchair-mounted robotic arm (USF WMRA-II), which has 9 degrees-of-freedom, was carried out under this Master's thesis research. First, the rotational displacements about the 7 joints of the robotic arm were calibrated. It was followed by setting the control gains of the motors. Then existing high-level programs developed using C++ and Matlab for USF WMRA-I were modified for WMRA-II. The required low-level programs to provide complete kinematics of the joint movements to the controller board of WMRA-II (Ga

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Vanden, Berghen Frank. "Constrained, non-linear, derivative-free, parallel optimization of continuous, high computing load, noisy objective functions." Doctoral thesis, Universite Libre de Bruxelles, 2004. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211177.

Der volle Inhalt der Quelle

Annotation:

The main result is a new original algorithm: CONDOR ("COnstrained, Non-linear, Direct, parallel Optimization using trust Region method for high-computing load, noisy functions"). The aim of this algorithm is to find the minimum x* of an objective function F(x) (x is a vector whose dimension is between 1 and 150) using the least number of function evaluations of F(x). It is assumed that the dominant computing cost of the optimization process is the time needed to evaluate the objective function F(x) (One evaluation can range from 2 minutes to 2 days). The algorithm will try to minimize the numb

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Schreiber, Alex Joachim Ernst [Verfasser], Oliver [Akademischer Betreuer] Junge, and Matthias [Akademischer Betreuer] Gerdts. "Dynamic programming with radial basis functions and Shepard's method / Alex Joachim Ernst Schreiber. Betreuer: Oliver Junge. Gutachter: Matthias Gerdts ; Oliver Junge." München : Universitätsbibliothek der TU München, 2016. http://d-nb.info/1096459124/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Cox, Bruce. "Applications of accuracy certificates for problems with convex structure." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39489.

Der volle Inhalt der Quelle

Annotation:

Applications of accuracy certificates for problems with convex structure This dissertation addresses the efficient generation and potential applications of accuracy certificates in the framework of “black-box-represented” convex optimization problems - convex problems where the objective and the constraints are represented by “black boxes” which, given on input a value x of the argument, somehow (perhaps in a fashion unknown to the user) provide on output the values and the derivatives of the objective and the constraints at x. The main body of the dissertation can be split into three parts

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Теницька, А. О. "Математика в комп'ютерних іграх". Thesis, Сумський державний університет, 2018. http://essuir.sumdu.edu.ua/handle/123456789/66861.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!