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

Dissertationen zum Thema „Programming applications“

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 applications" 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

Longley, Mark. "Functional programming applications." Thesis, University of Kent, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303191.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Johnsson, Ola, Magnus Stenemo, and Zain ul-Abdin. "Programming & Implementation of Streaming Applications." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-283.

Der volle Inhalt der Quelle
Annotation:
<p>Streaming applications like multimedia and radar signal processing applications are becoming </p><p>increasingly compute-intensive. To overcome the computational demands new parallel </p><p>architectures are emerging. </p><p> </p><p>The programming tools provided with these architectures require low-level programming, which </p><p>creates a need for a common high-level architecture independent language that can exploit </p><p>parallelism efficiently. One such language is StreamIt, designed around the notions of streams </p><p>and stream transformers, which allows efficient mapping to a var
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Johnsson, Ola, Magnus Stenemo, and Zain-ul-Abdin. "Programming & Implementation of Streaming Applications." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-283.

Der volle Inhalt der Quelle
Annotation:
Streaming applications like multimedia and radar signal processing applications are becoming increasingly compute-intensive. To overcome the computational demands new parallel architectures are emerging.   The programming tools provided with these architectures require low-level programming, which creates a need for a common high-level architecture independent language that can exploit parallelism efficiently. One such language is StreamIt, designed around the notions of streams and stream transformers, which allows efficient mapping to a variety of architectures.   The overall goal of this ma
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lanzoni, Silvia. "A Unified Application Programming Interface for Bundle Protocol Applications." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amslaurea.unibo.it/25727/.

Der volle Inhalt der Quelle
Annotation:
Next space missions should rely on the DTN architecture and its associated Bundle Protocol (BP) to cope with the challenges faced by interplanetary links, such as long delays and disruption. This has led to new BP implementations or new releases, incorporating version 7, recently standardized by IETF. Although positive per se, this has exacerbated an already existing fragmentation problem, as every implementation has its own API and its own set of bundle options supported, which is a significant obstacle to the development of third party applications. To alleviate this problem, a new “abstrac
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Wang, Meng. "Bidirectional programming and its applications." Thesis, University of Oxford, 2011. http://kar.kent.ac.uk/55795/.

Der volle Inhalt der Quelle
Annotation:
Many problems in programming involve pairs of computations that cancel out each other's effects; some examples include parsing/printing, embed- ding/ projection, marshalling/unmarshalling, compressing/ de-com pressing etc. To avoid duplication of effort, the paradigm of bidirectional programming aims at to allow the programmer to write a single program that expresses both computations. Despite being a promising idea, existing studies mainly focus on the view-update problem in databases and its variants; and the impact of bidirectional programming has not reached the wider community. The goal o
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Caroli, Alberto. "Genetic Programming applications in Robotics." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/5860/.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Liu, Tong <1988&gt. "Innovative Applications of Constraint Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amsdottorato.unibo.it/9068/1/main.pdf.

Der volle Inhalt der Quelle
Annotation:
Constraint programming (CP) is a declarative paradigm that enables us to model a problem in the form of constraints to be satisfied. It offers powerful constraint solvers which, by implementing general-purpose search techniques, are fast and robust to address complex constraint models automatically. Constraint programming has attracted the attention of people from various domains. By separating the definition of a problem from its solution, it is more natural for people to implement the program directly from the problem specification, reducing the cost of development and future maintenance sig
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Mabrouk, Emad Hamdy Ahmed. "Meta-Heuristics Programming and Its Applications." 京都大学 (Kyoto University), 2011. http://hdl.handle.net/2433/142132.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Ye, Kai. "Applications of semidefinite programming in finance." Thesis, Imperial College London, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.508489.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Rochefort, Stephen. "Logic programming applications in educational environments." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0012/NQ61676.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

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.

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

Bundfuss, Stefan. "Copositive matrices, copositive programming, and applications." Tönning Lübeck Marburg Der Andere Verl, 2009. http://d-nb.info/994323700/04.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

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

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

De, Lorenzo Andrea. "Genetic Programming Techniques in Engineering Applications." Doctoral thesis, Università degli studi di Trieste, 2014. http://hdl.handle.net/10077/9991.

Der volle Inhalt der Quelle
Annotation:
2012/2013<br>Machine learning is a suite of techniques that allow developing algorithms for performing tasks by generalizing from examples. Machine learning systems, thus, may automatically synthesize programs from data. This approach is often feasible and cost-effective where manual programming or manual algorithm design is not. In the last decade techniques based on machine learning have spread in a broad range of application domains. In this thesis, we will present several novel applications of a specific machine Learning technique, called Genetic Programming, to a wide set of enginee
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Costa, Alberto. "Applications of Reformulations in Mathematical Programming." Phd thesis, Palaiseau, Ecole polytechnique, 2012. https://pastel.hal.science/docs/00/74/60/83/PDF/Phd_Costa.pdf.

Der volle Inhalt der Quelle
Annotation:
La programmation mathématique est une technique qui peut être utilisée pour résoudre des problèmes concrets où l'on veut maximiser, ou minimiser, une fonction objectif soumise à des contraintes sur les variables décisionnelles. Les caractéristiques les plus importantes de la programmation mathématique sont la création d'un modèle pour décrire le problème (aussi appelé formulation), et la mise en œuvre d'algorithmes efficaces pour le résoudre (aussi appelés solveurs). Dans cette thèse, on s'occupe du premier point. Plus précisemment, on étudie certains problèmes qui proviennent de domaines diff
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Costa, Alberto. "Applications of Reformulations in Mathematical Programming." Phd thesis, Ecole Polytechnique X, 2012. http://pastel.archives-ouvertes.fr/pastel-00746083.

Der volle Inhalt der Quelle
Annotation:
La programmation mathématique est une technique qui peut être utilisée pour résoudre des problèmes concrets où l'on veut maximiser, ou minimiser, une fonction objectif soumise à des contraintes sur les variables décisionnelles. Les caractéristiques les plus importantes de la programmation mathématique sont la création d'un modèle pour décrire le problème (aussi appelé formulation), et la mise en œuvre d'algorithmes efficaces pour le résoudre (aussi appelés solveurs). Dans cette thèse, on s'occupe du premier point. Plus précisemment, on étudie certains problèmes qui proviennent de domaines diff
APA, Harvard, Vancouver, ISO und andere Zitierweisen
18

Tejedor, Saavedra Enric. "Programming and parallelising applications for distributed infrastructures." Doctoral thesis, Universitat Politècnica de Catalunya, 2013. http://hdl.handle.net/10803/129576.

Der volle Inhalt der Quelle
Annotation:
The last decade has witnessed unprecedented changes in parallel and distributed infrastructures. Due to the diminished gains in processor performance from increasing clock frequency, manufacturers have moved from uniprocessor architectures to multicores; as a result, clusters of computers have incorporated such new CPU designs. Furthermore, the ever-growing need of scienti c applications for computing and storage capabilities has motivated the appearance of grids: geographically-distributed, multi-domain infrastructures based on sharing of resources to accomplish large and complex tasks. More
APA, Harvard, Vancouver, ISO und andere Zitierweisen
19

Taha, Walid. "Multi-Stage Programming : Its Theory and Applications." Doctoral thesis, Oregon Graduate Institute of Science and Technology, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15052.

Der volle Inhalt der Quelle
Annotation:
MetaML is a statically typed functional programming language with special support for programgeneration. In addition to providing the standard features of contemporary programminglanguages such as Standard ML, MetaML provides three staging annotations. These staging annotationsallow the construction, combination, and execution of object-programs.Our thesis is that MetaML's three staging annotations provide a useful, theoretically soundbasis for building program generators. This dissertation reports on our study of MetaML's stagingconstructs, their use, their implementation, and their formal se
APA, Harvard, Vancouver, ISO und andere Zitierweisen
20

Poojari, C. A. "Stochastic programming : models, solution methods and applications." Thesis, Brunel University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247549.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
21

Yee-King, Matthew John. "Automatic sound synthesizer programming : techniques and applications." Thesis, University of Sussex, 2011. http://sro.sussex.ac.uk/id/eprint/7612/.

Der volle Inhalt der Quelle
Annotation:
The aim of this thesis is to investigate techniques for, and applications of automatic sound synthesizer programming. An automatic sound synthesizer programmer is a system which removes the requirement to explicitly specify parameter settings for a sound synthesis algorithm from the user. Two forms of these systems are discussed in this thesis: tone matching programmers and synthesis space explorers. A tone matching programmer takes at its input a sound synthesis algorithm and a desired target sound. At its output it produces a configuration for the sound synthesis algorithm which causes it to
APA, Harvard, Vancouver, ISO und andere Zitierweisen
22

Luo, Xiaodong. "Continuous linear programming : theory, algorithms and applications." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/10591.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
23

Chen, Jodie Lian. "Chorus : end user programming of social applications." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112902.

Der volle Inhalt der Quelle
Annotation:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (page 65).<br>Chorus is an end-user programming tool for building mobile social applications, much in the spirit of HyperCard¹ but reimagined for modern cloud-based applications on smart phones. Chorus innovates in two dimensions: first, by supporting collaboration via "social datatypes" that define a shared structured document; second, by providing a simple user interfaces on smartphones that su
APA, Harvard, Vancouver, ISO und andere Zitierweisen
24

Phillips, Brent M. (Brent Michael). "A distributed programming system for media applications." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36960.

Der volle Inhalt der Quelle
Annotation:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.<br>Includes bibliographical references (leaves 104-106).<br>by Brent M. Phillips.<br>M.S.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
25

Wong, Eric M. Eng Massachusetts Institute of Technology. "Optimizations in stream programming for multimedia applications." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/85522.

Der volle Inhalt der Quelle
Annotation:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 85-89).<br>Multimedia applications are the most dominant workload in desktop and mobile computing. Such applications regularly process continuous sequences of data and can be naturally represented under the stream programming domain to take take advantage of domain-specific optimizations. Exploiting characteristics specific to multimedia programs can provide further significant impact on p
APA, Harvard, Vancouver, ISO und andere Zitierweisen
26

Glen, Andrew Gordon. "A probability programming language: Development and applications." W&M ScholarWorks, 1998. https://scholarworks.wm.edu/etd/1539623920.

Der volle Inhalt der Quelle
Annotation:
A probability programming language is developed and presented; applications illustrate its use. Algorithms and generalized theorems used in probability are encapsulated into a programming environment with the computer algebra system Maple to provide the applied community with automated probability capabilities. Algorithms of procedures are presented and explained, including detailed presentations on three of the most significant procedures. Applications that encompass a wide range of applied topics including goodness-of-fit testing, probabilistic modeling, central limit theorem augmentation, g
APA, Harvard, Vancouver, ISO und andere Zitierweisen
27

Chung, Wai Hing. "Teaching computer control applications : a programming approach." Thesis, University of Edinburgh, 1986. http://hdl.handle.net/1842/19628.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
28

Hsiung, Kan-Lin. "Geometric programming under uncertainty with engineering applications /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
29

AZZOLINI, DAMIANO. "Extensions and Applications of Probabilistic Logic Programming." Doctoral thesis, Università degli studi di Ferrara, 2022. http://hdl.handle.net/11392/2478826.

Der volle Inhalt der Quelle
Annotation:
L'intelligenza artificiale simbolica viene definita come ''Good Old-Fashioned Artificial Intelligence'' perché rappresenta ciò che è noto tramite simboli (per esempio, predicati del primo ordine e costanti) invece che tramite matrici di numeri, come accade per le soluzioni sub-simboliche (principalmente reti neurali). Nonostante il recente predominio delle reti neurali, considerate quasi una panacea per risolvere qualsiasi problema legato all'apprendimento automatico, esiste un ambito di ricerca in rapida espansione chiamato Statistical Relational Artificial Intelligence dove l'obiettivo è qu
APA, Harvard, Vancouver, ISO und andere Zitierweisen
30

Wang, Xia. "Applications of genetic algorithms, dynamic programming, and linear programming to combinatorial optimization problems." College Park, Md.: University of Maryland, 2008. http://hdl.handle.net/1903/8778.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.) -- University of Maryland, College Park, 2008.<br>Thesis research directed by: Applied Mathematics & Statistics, and Scientific Computation Program. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
31

Albrecht, Conan Carl. "Programming framework supporting the rapid application development of highly-interactive, collaborative applications." Diss., The University of Arizona, 2000. http://hdl.handle.net/10150/558708.

Der volle Inhalt der Quelle
Annotation:
Business team collaboration in the future will increasingly take place in an environment where everything is potentially distributed. Traditional group support systems have been LAN-based and have not ported easily to distributed, Internet-based products. Rather, distributed group support systems require new architectures if they are to support the same type of real-time, high-collaboration environments that traditional systems have. This dissertation describes the development of a server architecture and programming model to support the rapid application development of real-time, dist
APA, Harvard, Vancouver, ISO und andere Zitierweisen
32

Byrd, William E. "Relational programming in miniKanren techniques, applications, and implementations /." [Bloomington, Ind.] : Indiana University, 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3380156.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph.D.)--Indiana University, Dept. of Computer Science, 2009.<br>Title from PDF t.p. (viewed on Jul 20, 2010). Source: Dissertation Abstracts International, Volume: 70-12, Section: B, page: 7659. Adviser: Daniel P. Friedman.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
33

Van, Ackooij Wim. "Chance Constrained Programming : with applications in Energy Management." Thesis, Châtenay-Malabry, Ecole centrale de Paris, 2013. http://www.theses.fr/2013ECAP0071/document.

Der volle Inhalt der Quelle
Annotation:
Les contraintes en probabilité constituent un modèle pertinent pour gérer les incertitudes dans les problèmes de décision. En management d’énergie de nombreux problèmes d’optimisation ont des incertitudes sous-jacentes. En particulier c’est le cas des problèmes de gestion de la production au court-terme. Dans cette Thèse, nous investiguons les contraintes probabilistes sous l’angle théorique, algorithmique et applicative. Nous donnons quelques nouveaux résultats de différentiabilité des contraintes en probabilité et de convexité des ensembles admissibles. Des nouvelles variantes des méthodes d
APA, Harvard, Vancouver, ISO und andere Zitierweisen
34

Shields, Matthew S. "Visual programming environments for multi-disciplinary distributed applications." Thesis, Cardiff University, 2004. http://orca.cf.ac.uk/55952/.

Der volle Inhalt der Quelle
Annotation:
A Problem Solving Environment is a complete, integrated computing environment for composing, compiling and running applications in a specific problem area or domain. A Visual Programming Environment is one possible front end to a problem solving environment. It applies the visual programming paradigms of "point and click" and "drag and drop", via a Graphical User Interface, to the various constituent components that are used to assemble an application. The aim of the problem solving environment presented here is to provide the ability to build up scientific applications by connecting, or plugg
APA, Harvard, Vancouver, ISO und andere Zitierweisen
35

Thar, M. S. "Intention-oriented programming model for autonomic cloud applications." Thesis, Liverpool John Moores University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526921.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
36

Van, ackooij Wim Stefanus. "Chance Constrained Programming : with applications in Energy Management." Phd thesis, Ecole Centrale Paris, 2013. http://tel.archives-ouvertes.fr/tel-00978519.

Der volle Inhalt der Quelle
Annotation:
In optimization problems involving uncertainty, probabilistic constraints are an important tool for defining safety of decisions. In Energy management, many optimization problems have some underlying uncertainty. In particular this is the case of unit commitment problems. In this Thesis, we will investigate probabilistic constraints from a theoretical, algorithmic and applicative point of view. We provide new insights on differentiability of probabilistic constraints and on convexity results of feasible sets. New variants of bundle methods, both of proximal and level type, specially tailored f
APA, Harvard, Vancouver, ISO und andere Zitierweisen
37

CERQUEIRA, CRISTINA URURAHY DA FONTOURA. "A MULTILANGUAGE PROGRAMMING MODEL FOR GEOGRAPHICALLY DISTRIBUTED APPLICATIONS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4649@1.

Der volle Inhalt der Quelle
Annotation:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Neste trabalho propomos usar o ALua, um mecanismo de comunicação orientado a eventos, baseado na linguagem interpretada Lua, para coordenação e desenvolvimento de aplicações paralelas distribuídas. ALua é um modelo de programação dual para aplicações paralelas distribuídas, que age como elemento de ligação, permitindo que partes pré- compiladas do programa sejam executadas em diferentes máquinas. Novas tecnologias em programação paralela, como computação em grade, e o interesse atual em computação distribuída para redes geográficas
APA, Harvard, Vancouver, ISO und andere Zitierweisen
38

Pinder, Robert William 1977. "Applications of genetic programming to parallel system optimization." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86507.

Der volle Inhalt der Quelle
Annotation:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.<br>Includes bibliographical references (p. 81-84).<br>by Robert William Pinder.<br>M.Eng.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
39

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

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
40

Bandini, Alessandro. "Programming and Deployment of Cloud-based Data Analysis Applications." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13803/.

Der volle Inhalt der Quelle
Annotation:
Cloud Computing constitutes a model capable of enabling the network access in a shared, practical and on demand of different computational resources like networks, memory, application or services. This work has as goal the explanation of the project made within Cloud Computing. After an introduction of the theory that lies behind Cloud computing's technologies, there is the practical part of the the work, starting from a more specific platform, Hadoop, which allows storage and data analysis and then moving to more general purpose platforms, Amazon Web Services and Google App Engine, where di
APA, Harvard, Vancouver, ISO und andere Zitierweisen
41

Howse, Samuel. "Dynamic programming problems, neural network solutions and economic applications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0009/MQ60678.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
42

Axehill, Daniel. "Applications of Integer Quadratic Programming in Control and Communication." Licentiate thesis, Linköping : Dept. of Electrical Engineering, Linköping University, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5263.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
43

Cymer, Radosław [Verfasser]. "Applications of matching theory in constraint programming / Radosław Cymer." Hannover : Technische Informationsbibliothek und Universitätsbibliothek Hannover (TIB), 2014. http://d-nb.info/1050990498/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
44

Mahar, Mumtaz Hussain. "Network optimization and its applications to discrete programming problems." Thesis, Brunel University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294509.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
45

Chen, Fei, and 陳飛. "Linear programming techniques for algorithms with applications in economics." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206329.

Der volle Inhalt der Quelle
Annotation:
We study algorithms and models for several economics-related problems from the perspective of linear programming. In network bargaining games, stable and balanced outcomes have been investigated in previous work. However, existence of such outcomes requires that the linear program relaxation of a certain maximum matching problem has integral optimal solution. We propose an alternative model for network bargaining games in which each edge acts as a player, who proposes how to split the weight of the edge among the two incident nodes. We show that the distributed protocol by Kanoria et. al ca
APA, Harvard, Vancouver, ISO und andere Zitierweisen
46

LONGO, HUMBERTO JOSE. "INTEGER PROGRAMMING TECHNIQUES AND APPLICATIONS TO VEHICLE ROUTING PROBLEMS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6029@1.

Der volle Inhalt der Quelle
Annotation:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>UNIVERSIDADE FEDERAL DE GOIÁS<br>A natureza intrinsicamente combinatorial de muitos problemas advindos da área de logística de transportes, em especial aqueles que dizem respeito ao uso racional de frotas de veículos, sugere que boa parte dos mesmos pode ser formulada e resolvida como um problema de programação linear inteira. Contudo, a maioria dos algoritmos até o momento disponíveis não consegue encontrar, em tempos computacionais aceitáveis, a solução ótima para instâncias de porte razoável. O objeto de estudo desta t
APA, Harvard, Vancouver, ISO und andere Zitierweisen
47

Valenti, Mario J. (Mario James) 1976. "Approximate dynamic programming with applications in multi-agent systems." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40330.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>MIT Institute Archives copy: contains CDROM of thesis in .pdf format.<br>Includes bibliographical references (p. 151-161).<br>This thesis presents the development and implementation of approximate dynamic programming methods used to manage multi-agent systems. The purpose of this thesis is to develop an architectural framework an
APA, Harvard, Vancouver, ISO und andere Zitierweisen
48

Jordan, Eric Michael. "Programming models for the development of interactive audio applications." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/37764.

Der volle Inhalt der Quelle
Annotation:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.<br>Includes bibliographical references (leaves 59-63).<br>by Eric Michael Jordan.<br>M.S.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
49

Elshazly, Hatem Mohamed Abdelfattah Eid. "Programming model abstractions for optimizing I/O intensive applications." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/673638.

Der volle Inhalt der Quelle
Annotation:
This thesis contributes from the perspective of task-based programming models to the efforts of optimizing I/O intensive applications. Throughout this thesis, we propose programming model abstractions and mechanisms that target a twofold objective: from the one hand, improve the I/O and total performance of applications on nowadays complex storage infrastructures. From the other hand, achieve such performance improvement without increasing the complexity of applications programming. The following paragraphs briefly summarize each of our contributions. First, towards exploiting compute-I/O p
APA, Harvard, Vancouver, ISO und andere Zitierweisen
50

Tuncbilek, Cihan H. "Polynomial and indefinite quadratic programming problems: algorithms and applications." Diss., Virginia Tech, 1994. http://hdl.handle.net/10919/39040.

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!