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

Rozprawy doktorskie na temat „Programming”

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”.

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

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.
2

Espinoza, Daniel G. "On Linear Programming, Integer Programming and Cutting Planes." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10482.

Pełny tekst źródła
Streszczenie:
In this thesis we address three related topic in the field of Operations Research. Firstly we discuss the problems and limitation of most common solvers for linear programming, precision. We then present a solver that generate rational optimal solutions to linear programming problems by solving a succession of (increasingly more precise) floating point approximations of the original rational problem until the rational optimality conditions are achieved. This method is shown to be (on average) only 20% slower than the common pure floating point approach, while returning true optimal solutions
Style APA, Harvard, Vancouver, ISO itp.
3

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.
4

Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.

Pełny tekst źródła
Streszczenie:
In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by i
Style APA, Harvard, Vancouver, ISO itp.
5

Yoo, Daniel. "Building Web Based Programming Environments for Functional Programming." Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-dissertations/181.

Pełny tekst źródła
Streszczenie:
Functional programming offers an accessible and powerful algebraic model for computing. JavaScript is the language of the ubiquitous Web, but it does not support functional programs well due to its single-threaded, asynchronous nature and lack of rich control flow operators. The purpose of this work is to extend JavaScript to a language environment that satisfies the needs of functional programs on the Web. This extended language environment uses sophisticated control operators to provide an event-driven functional programming model that cooperates with the browser's DOM, along with synchron
Style APA, Harvard, Vancouver, ISO itp.
6

Jama, Fartun. "Integrating secure programming concepts in introductory programming courses." Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-96870.

Pełny tekst źródła
Streszczenie:
The number of vulnerable systems with exploitable security defects has increased. This led to an increase in the demand for secure software systems. Software developers lack security experiences to design and build secure software, some even believe security is not their responsibility. Despite the increased need for teaching security and secure programming, security is not well integrated into the undergraduate computing curriculum and is only offered as part of a program or as an elective course. The aim of this project is to outline the importance of incorporating security and secure progra
Style APA, Harvard, Vancouver, ISO itp.
7

Alam, Abu S. "A programming system for end-user functional programming." Thesis, University of Gloucestershire, 2015. http://eprints.glos.ac.uk/2738/.

Pełny tekst źródła
Streszczenie:
This research involves the construction of a programming system, HASKEU, to support end-user programming in a purely functional programming language. An end-user programmer is someone who may program a computer to get their job done, but has no interest in becoming a computer programmer. A purely functional programming language is one that does not require the expression of statement sequencing or variable updating. The end-user is offered two views of their functional program. The primary view is a visual one, in which the program is presented as a collection of boxes (representing processes)
Style APA, Harvard, Vancouver, ISO itp.
8

Zemkoho, Alain B. "Bilevel programming." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2012. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-89017.

Pełny tekst źródła
Streszczenie:
We have considered the bilevel programming problem in the case where the lower-level problem admits more than one optimal solution. It is well-known in the literature that in such a situation, the problem is ill-posed from the view point of scalar objective optimization. Thus the optimistic and pessimistic approaches have been suggested earlier in the literature to deal with it in this case. In the thesis, we have developed a unified approach to derive necessary optimality conditions for both the optimistic and pessimistic bilevel programs, which is based on advanced tools from variational ana
Style APA, Harvard, Vancouver, ISO itp.
9

Zuliani, Paolo. "Quantum programming." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393364.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Mahmood, Muhammad Yasir. "Inexact Programming." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4351.

Pełny tekst źródła
Streszczenie:
Two types of fuzzy linear programming i.e. fuzzy number linear programming and interval number linear programming are used for optimization problems. In interval form of linear programming we convert the inequalities from the feasible region, containing intervals as coefficients, to two groups of inequalities characterized by real, exact coefficients values. Then classical programming has been used to achieve an optimal solution in the feasible region. In fuzzy number linear programming, α‐cuts and LR forms of fuzzy numbers as coefficients have been used to find optimal solution in the feasibl
Style APA, Harvard, Vancouver, ISO itp.
11

Mitchell, R. "Literate programming." Thesis, University of Hertfordshire, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380654.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Randazzo, Alexander. "Programming Pains." Digital Commons at Loyola Marymount University and Loyola Law School, 2020. https://digitalcommons.lmu.edu/etd/920.

Pełny tekst źródła
Streszczenie:
Programming Pains (feature, sci-fi dramedy): In the near future, a tech-obsessed woman, one half of a married couple unable to conceive, designs two android children to create the perfect home, which is threatened when the oldest droid – in his teen angst – joins an Artificial Intelligence Rights group.
Style APA, Harvard, Vancouver, ISO itp.
13

Michlowitz, Jason Lawrence. "A methodology for mapping programming languages to programming problems /." View online, 2006. http://ecommons.txstate.edu/cscitad/2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
14

Qian, Xun. "Continuous methods for convex programming and convex semidefinite programming." HKBU Institutional Repository, 2017. https://repository.hkbu.edu.hk/etd_oa/422.

Pełny tekst źródła
Streszczenie:
In this thesis, we study several interior point continuous trajectories for linearly constrained convex programming (CP) and convex semidefinite programming (SDP). The continuous trajectories are characterized as the solution trajectories of corresponding ordinary differential equation (ODE) systems. All our ODE systems are closely related to interior point methods.. First, we propose and analyze three continuous trajectories, which are the solutions of three ODE systems for linearly constrained convex programming. The three ODE systems are formulated based on an variant of the affine scaling
Style APA, Harvard, Vancouver, ISO itp.
15

Patel, Harsida. "Diet planning by goal programming and integer goal programming." Thesis, University of Portsmouth, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286085.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
16

Bird, Philip. "Unifying programming paradigms : logic programming and finite state automata." Thesis, University of Sheffield, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.419609.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
17

Lones, Michael Adam. "Enzyme genetic programming : modelling biological evolvability in genetic programming." Thesis, University of York, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399653.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
18

Ilyes, Amy Louise. "Using linear programming to solve convex quadratic programming problems." Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
19

Vielma, Centeno Juan Pablo. "Mixed integer programming approaches for nonlinear and stochastic programming." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29624.

Pełny tekst źródła
Streszczenie:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Nemhauser, George; Committee Co-Chair: Ahmed, Shabbir; Committee Member: Bill Cook; Committee Member: Gu, Zonghao; Committee Member: Johnson, Ellis. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Style APA, Harvard, Vancouver, ISO itp.
20

Vigerske, Stefan. "Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16704.

Pełny tekst źródła
Streszczenie:
Diese Arbeit leistet Beiträge zu zwei Gebieten der mathematischen Programmierung: stochastische Optimierung und gemischt-ganzzahlige nichtlineare Optimierung (MINLP). Im ersten Teil erweitern wir quantitative Stetigkeitsresultate für zweistufige stochastische gemischt-ganzzahlige lineare Programme auf Situationen in denen Unsicherheit gleichzeitig in den Kosten und der rechten Seite auftritt, geben eine ausführliche Übersicht zu Dekompositionsverfahren für zwei- und mehrstufige stochastische lineare und gemischt-ganzzahlig lineare Programme, und diskutieren Erweiterungen und Kombinationen d
Style APA, Harvard, Vancouver, ISO itp.
21

Andreotti, Sandro [Verfasser]. "Linear Programming and Integer Linear Programming in Bioinformatics / Sandro Andreotti." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/1066645213/34.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Shen, Yijiang. "Binary image restoration by positive semidefinite programming and signomial programming." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/HKUTO/record/B39557431.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

Loebner, Sarah E. K. "Early Life Epigenetic Programming and Later Psychological Ramifications: Programming Positivity." Scholarship @ Claremont, 2014. http://scholarship.claremont.edu/scripps_theses/407.

Pełny tekst źródła
Streszczenie:
Epigenetics is the field of focus when determining how environmental and behavioral factors can directly impact the expression of genes that affect our behavior. Existing studies have examined links between eliciting stress behaviors in pregnant mice and the negative stress behavioral responses in offspring for several subsequent generations, which points to a disposition to adverse stress responses later in life due to early-life epigenetic modifi- cations. Similarly, research on both rats and humans has found early life trauma to be a large factor in both the hyper- and de-methylation of gen
Style APA, Harvard, Vancouver, ISO itp.
24

沈逸江 and Yijiang Shen. "Binary image restoration by positive semidefinite programming and signomial programming." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39557431.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
25

Boberg, Arvid. "Virtual lead-through robot programming : Programming virtual robot by demonstration." Thesis, Högskolan i Skövde, Institutionen för ingenjörsvetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-11403.

Pełny tekst źródła
Streszczenie:
This report describes the development of an application which allows a user to program a robot in a virtual environment by the use of hand motions and gestures. The application is inspired by the use of robot lead-through programming which is an easy and hands-on approach for programming robots, but instead of performing it online which creates loss in productivity the strength from offline programming where the user operates in a virtual environment is used as well. Thus, this is a method which saves on the economy and prevents contamination of the environment. To convey hand gesture informat
Style APA, Harvard, Vancouver, ISO itp.
26

Petre, Marian. "Findings a basis for matching programming languages to programming tasks." Thesis, University College London (University of London), 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.252003.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
27

Toczé, Klervie. "Functional Reactive Programming as programming model for telecom server software." Thesis, Linköpings universitet, Programvara och system, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-113142.

Pełny tekst źródła
Streszczenie:
This thesis studies the use of the functional reactive programming (FRP) framework reactive-banana in a prototype which simulates a part of a Long-Term Evolution (LTE) base station: the Radio Resource Control connection setup procedure. The investigated problem is to determine whether using this FRP framework leads to an implementation with suitable performance and improved maintainability compared to the current implementation. Enhancing the maintainability of the base station software enables quicker and more efficient maintenance activities, which lead to an improved customer satisfaction.
Style APA, Harvard, Vancouver, ISO itp.
28

Carpenter, Steven M. "Visual meta-programming language graphical user interface for generative programming." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02sep%5FCarpenter.pdf.

Pełny tekst źródła
Streszczenie:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2002.<br>Thesis advisor(s): Mikhail Auguston, Richard Riehle. Includes bibliographical references (p. 89). Also available online.
Style APA, Harvard, Vancouver, ISO itp.
29

Wang, Guanglei. "Relaxations in mixed-integer quadratically constrained programming and robust programming." Thesis, Evry, Institut national des télécommunications, 2016. http://www.theses.fr/2016TELE0026/document.

Pełny tekst źródła
Streszczenie:
De nombreux problèmes de la vie réelle sont exprimés sous la forme de décisions à prendre à l’aide de l’information accessible dans le but d’atteindre certains objectifs. La programmation numérique a prouvé être un outil efficace pour modéliser et résoudre une grande variété de problèmes de ce type. Cependant, de nombreux problèmes en apparence faciles sont encore durs à résoudre. Et même des problèmes faciles de programmation linéaire deviennent durs avec l’incertitude de l’information disponible. Motivés par un problème de télécommunication où l’on doit associer des machines virtuelles à des
Style APA, Harvard, Vancouver, ISO itp.
30

Wang, Guanglei. "Relaxations in mixed-integer quadratically constrained programming and robust programming." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2016. http://www.theses.fr/2016TELE0026.

Pełny tekst źródła
Streszczenie:
De nombreux problèmes de la vie réelle sont exprimés sous la forme de décisions à prendre à l’aide de l’information accessible dans le but d’atteindre certains objectifs. La programmation numérique a prouvé être un outil efficace pour modéliser et résoudre une grande variété de problèmes de ce type. Cependant, de nombreux problèmes en apparence faciles sont encore durs à résoudre. Et même des problèmes faciles de programmation linéaire deviennent durs avec l’incertitude de l’information disponible. Motivés par un problème de télécommunication où l’on doit associer des machines virtuelles à des
Style APA, Harvard, Vancouver, ISO itp.
31

Koch, Thorsten. "Rapid mathematical programming." [S.l.] : [s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=973541415.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

Achterberg, Tobias. "Constraint integer programming /." München : Verl. Dr. Hut, 2008. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017108806&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
33

Sarrabezolles, Pauline. "Colourful linear programming." Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1033/document.

Pełny tekst źródła
Streszczenie:
Le théorème de Carathéodory coloré, prouvé en 1982 par Bárány, énonce le résultat suivant. Etant donnés d Å1 ensembles de points S1,SdÅ1 dans Rd , si chaque Si contient 0 dans son enveloppe convexe, alors il existe un sous-ensemble arc-en-ciel T µ SdÅ1 iÆ1 Si contenant 0 dans son enveloppe convexe, i.e. un sous-ensemble T tel que jT \Si j • 1 pour tout i et tel que 0 2 conv(T ). Ce théorème a donné naissance à de nombreuses questions, certaines algorithmiques et d’autres plus combinatoires. Dans ce manuscrit, nous nous intéressons à ces deux aspects. En 1997, Bárány et Onn ont défini la progra
Style APA, Harvard, Vancouver, ISO itp.
34

Zhang, Yan. "Dynamic programming speedups /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20ZHANGY.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
35

Gamble, James Graham. "Explicit parallel programming." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06082009-171019/.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

McPhee, Richard. "Compositional logic programming." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393413.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
37

Toni, Francesca. "Abductive logic programming." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.490558.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
38

Clare, A. R. "Evaluating declarative programming." Thesis, University of East Anglia, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235233.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
39

Hill, Stephen A. "Functional programming techniques." Thesis, University of Kent, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.236147.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
40

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
41

Ferreira, Nivea de Carvalho. "Programming uncertain agents." Thesis, University of Liverpool, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433730.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
42

Hirsch, Benjamin. "Programming rational agents." Thesis, University of Liverpool, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.415743.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
43

BARBOSA, SIMONE DINIZ JUNQUEIRA. "PROGRAMMING VIA INTERFACE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1999. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=1814@1.

Pełny tekst źródła
Streszczenie:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>A indústria de software vem ao longo dos anos aumentando a funcionalidade das aplicações, numa tentativa de satisfazer as necessidades do maior número de usuários possível. Esta solução, no entanto, implica grandes desafios de usabilidade, devido à complexidade cada vez maior destas aplicações. Uma tendência que visa a acomodar as necessidades dos usuários sem sobrecarregar o software com funcionalidade de uso infreqüente é permitir que os próprios usuários finais configurem ou programem as aplicações, através de mecanismo
Style APA, Harvard, Vancouver, ISO itp.
44

Orchard, Dominic Alaistair. "Programming contextual computations." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708000.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
45

Alley, Peter J. "Introductory Microcontroller Programming." Digital WPI, 2011. https://digitalcommons.wpi.edu/etd-theses/439.

Pełny tekst źródła
Streszczenie:
This text is a treatise on microcontroller programming. It introduces the major peripherals found on most microcontrollers, including the usage of them, focusing on the ATmega644p in the AVR family produced by Atmel. General information and background knowledge on several topics is also presented. These topics include information regarding the hardware of a microcontroller and assembly code as well as instructions regarding good program structure and coding practices. Examples with code and discussion are presented throughout. This is intended for hobbyists and students desiring knowledge on p
Style APA, Harvard, Vancouver, ISO itp.
46

Perera, Roland. "Interactive functional programming." Thesis, University of Birmingham, 2013. http://etheses.bham.ac.uk//id/eprint/4209/.

Pełny tekst źródła
Streszczenie:
We propose a new kind of execution environment where applications can be debugged and re-programmed while they are being used. We call our overall concept interactive programming. We develop some of the key components of interactive programming in the setting of a pure, call-by-value functional language. We illustrate our ideas via a proof-of-concept implementation called lambdaCalc, but leave several important components of the overall vision, including efficient incremental update and scaling to large programs, for future work. Our specific achievements are as follows. First, we show how to
Style APA, Harvard, Vancouver, ISO itp.
47

Milicevic, Aleksandar Ph D. Massachusetts Institute of Technology. "Advancing declarative programming." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99835.

Pełny tekst źródła
Streszczenie:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 141-153).<br>This thesis attempts to unite and consolidate two large and often culturally disjoint programming paradigms: declarative (focusing on specifying what a program is supposed to do, e.g., shuffle an array so that its elements are ordered) and imperative (detailing how the program intention is to be implemented, e.g., by applying the QuickSort algorithm). The ultimate result of suc
Style APA, Harvard, Vancouver, ISO itp.
48

Weimann, Oren. "Accelerating dynamic programming." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53302.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 129-136).<br>Dynamic Programming (DP) is a fundamental problem-solving technique that has been widely used for solving a broad range of search and optimization problems. While DP can be invoked when more specialized methods fail, this generality often incurs a cost in efficiency. We explore a unifying toolkit for speeding up DP, and algorithms that use DP as subroutines. Our methods and results ca
Style APA, Harvard, Vancouver, ISO itp.
49

Little, Greg (Danny Greg). "Programming with keywords." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40529.

Pełny tekst źródła
Streszczenie:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>Includes bibliographical references (p. 105-108).<br>Modern applications provide interfaces for scripting, but many users do not know how to write script commands. However, many users are familiar with the idea of entering keywords into a web search engine. Hence, if a user is familiar with the vocabulary of an application domain, they may be able to write a set of keywords expressing a command in that domain. For instance, in the web browsing domain, a user might enter the keyw
Style APA, Harvard, Vancouver, ISO itp.
50

Afanasieva, J., Наталія Ігорівна Муліна, Наталия Игоревна Мулина, and Nataliia Ihorivna Mulina. "Programming language C++." Thesis, Сумський державний університет, 2013. http://essuir.sumdu.edu.ua/handle/123456789/31143.

Pełny tekst źródła
Streszczenie:
C++ was written by Bjarne Stroustrup at Bell Labs during 1983-1985. C++ is an extension of C. Prior to 1983, Bjarne Stroustrup added functions to C and formed what he called "C with Classes". He had combined the Simula's use of classes and object-oriented functions with the power and efficiency of C. The term C++ was first used in 1983. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/31143
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!