Thematische Bibliographien / Programming applications

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Programming applications“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 10. Februar 2022

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 den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen 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.

Zeitschriftenartikel zum Thema "Programming applications"

Saleem, Nada, und Mohammad Hamdy. „Programming Mobile Applications“. AL-Rafidain Journal of Computer Sciences and Mathematics 10, Nr. 2 (01.07.2013): 189–202. http://dx.doi.org/10.33899/csmj.2013.163494.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Burnham, W. D., A. R. Hall und Ramachandran Bharath. „Prolog Programming and Applications“. IEEE Expert 1, Nr. 3 (September 1986): 108. http://dx.doi.org/10.1109/mex.1986.4306988.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gupta, Omprakash K. „Applications of Quadratic Programming“. Journal of Information and Optimization Sciences 16, Nr. 1 (Januar 1995): 177–94. http://dx.doi.org/10.1080/02522667.1995.10699213.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kalashnikov, Vyacheslav V., Stephan Dempe, Gerardo A. Pérez-Valdés, Nataliya I. Kalashnykova und José-Fernando Camacho-Vallejo. „Bilevel Programming and Applications“. Mathematical Problems in Engineering 2015 (2015): 1–16. http://dx.doi.org/10.1155/2015/310301.

Der volle Inhalt der Quelle

Annotation:

A great amount of new applied problems in the area of energy networks has recently arisen that can be efficiently solved only as mixed-integer bilevel programs. Among them are the natural gas cash-out problem, the deregulated electricity market equilibrium problem, biofuel problems, a problem of designing coupled energy carrier networks, and so forth, if we mention only part of such applications. Bilevel models to describe migration processes are also in the list of the most popular new themes of bilevel programming, as well as allocation, information protection, and cybersecurity problems. This survey provides a comprehensive review of some of the above-mentioned new areas including both theoretical and applied results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vandenberghe, Lieven, und Stephen Boyd. „Applications of semidefinite programming“. Applied Numerical Mathematics 29, Nr. 3 (März 1999): 283–99. http://dx.doi.org/10.1016/s0168-9274(98)00098-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wilson, W. G. „Prolog for applications programming“. IBM Systems Journal 25, Nr. 2 (1986): 190–206. http://dx.doi.org/10.1147/sj.252.0190.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tzotzis, Anastasios, Cesar Garcia-Hernandez, Jose-Luis Huertas-Talon, Dimitrios Tzetzis und Panagiotis Kyratsis. „Engineering applications using CAD based application programming interface“. MATEC Web of Conferences 94 (2017): 01011. http://dx.doi.org/10.1051/matecconf/20179401011.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shen, Hua, Guo Shun Zhou und Hui Qi Yan. „A Study of Parallelization and Performance Optimizations Based on OpenMP“. Applied Mechanics and Materials 321-324 (Juni 2013): 2933–37. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.2933.

Der volle Inhalt der Quelle

Annotation:

The primary consequence of the transition to multicore processors is that applications will increasingly need to be parallelized to improve application's throughput, responsiveness and latency. Multithreading is becoming increasingly important for modern programming. Unfortunately, parallel programming is no doubt much more tedious and error-prone than serial programming. Although modern compilers can manage threads well, but in practice, synchronization errors (such as: data race errors, deadlocks) required careful management and good optimization method. This paper presents a preliminary study of the usability of the Intel threading tools for multicore programming. This work compare performance of a single threaded application with multithreaded applications, use tools called Intel® VTune Performance Analyzer, Intel® Thread Checker and OpenMP to efficiently optimize multithreaded applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yerekesheva, M., und A. Beder. „DEVELOPMENT OF APPLICATIONS FOR LEARNING PROGRAMMING“. BULLETIN Series of Physics & Mathematical Sciences 70, Nr. 2 (30.06.2020): 211–15. http://dx.doi.org/10.51889/2020-2.1728-7901.33.

Der volle Inhalt der Quelle

Annotation:

Most modern students are ready to use mobile technology in the learning process, and understand the need to consider new opportunities for the best use of the potential of mobile devices and technologies. The solution of this task requires the introduction of mobile learning strategies, forms and methods in the educational process of universities. Currently, the development of mobile applications is one of the most popular tasks in the field of information technology. Applications can now analyze information from multiple sources and help the user make decisions, control processes, and solve other important tasks. This, in turn, helps to optimize business processes, increase productivity and efficiency of decisions. The article describes the process of designing and building a mobile application for teaching programming, software, content, and functionality.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Erdem, Esra, Michael Gelfond und Nicola Leone. „Applications of Answer Set Programming“. AI Magazine 37, Nr. 3 (07.10.2016): 53–68. http://dx.doi.org/10.1609/aimag.v37i3.2678.

Der volle Inhalt der Quelle

Annotation:

ASP has been applied fruitfully to a wide range of areas in AI and in other fields, both in academia and in industry, thanks to the expressive representation languages of ASP and the continuous improvement of ASP solvers. We present some of these ASP applications, in particular, in knowledge representation and reasoning, robotics, bioinformatics and computational biology as well as some industrial applications. We discuss the challenges addressed by ASP in these applications and emphasize the strengths of ASP as a useful AI paradigm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Programming applications"

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

Johnsson, Ola, Magnus Stenemo und 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 master’s thesis is to evaluate the StreamIt language from a programmability and portability point of view. An MPD-application has been developed in StreamIt, which is executed on the RAW simulator. Furthermore, a code generator is designed to compile and execute the application on the XPP simulator. The conclusions drawn are that StreamIt is easy to learn, but hard to use because of its programming paradigm as compared to conventional languages. StreamIt programming involves thinking in terms of streams instead of globally accessed memory. The structure of StreamIt makes it easy to reuse components and modify the application. The construction of the compiler makes it possible to port StreamIt application to various architectures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Johnsson, Ola, Magnus Stenemo und 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:

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 master’s thesis is to evaluate the StreamIt language from a

programmability and portability point of view. An MPD-application has been developed in

StreamIt, which is executed on the RAW simulator. Furthermore, a code generator is designed to

compile and execute the application on the XPP simulator.

The conclusions drawn are that StreamIt is easy to learn, but hard to use because of its

programming paradigm as compared to conventional languages. StreamIt programming involves

thinking in terms of streams instead of globally accessed memory. The structure of StreamIt

makes it easy to reuse components and modify the application. The construction of the compiler

makes it possible to port StreamIt application to various architectures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

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

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 of this thesis is to demonstrate, through concrete language designs and case studies, the relevance of bidirectional programming, in areas of computer science that have not been previously explored. In this thesis, we will argue for the importance of bidirectional programming in programming language design and compiler implementation. As evidence for this, we will propose a technique for incremental refactoring, which relies for its correctness on a bidirectional language and its properties, and devise a framework for implementing program transformations, with bidirectional properties that allow program analyses to be carried out in the transformed program, and have the results reported in the source program. Our applications of bidirectional programming to new areas bring up fresh challenges. This thesis also reflects on the challenges, and studies their impact to the design of bidirectional systems. We will review various design goals, including expressiveness, robustness, updatability, efficiency and easy of use, and show how certain choices, especially regarding updatability, can have significant influence on the effectiveness of bidirectional systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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 locally optimal parameters that does not require stable perturbations. This result is valid, in particular, for convex models with LFS constraints. The value of the model can be improved by one of several new formulations of the marginal value formula.
The results on stability are applied for bilevel convex models and an algorithm for solving these models, based on a marginal value formula, is suggested and then applied to a real-life problem in the petroleum industry.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

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èrents, et en commençant par les modèles les plus naturels pour les décrire, on présente des formulations alternatives, qui partagent certaines propriétés avec le modèle original mais qui sont en quelque sorte meilleures (par exemple au niveau du temps d'exécution nécessaire pour obtenir la solution par le solveur). Ces nouveaux modèles sont appelés reformulations. On suit la classification des reformulations proposée par Liberti dans [Reformulations in Mathematical Programming: Definitions and Systematics, RAIRO-OR, 43(1):55-86, 2009]: exact reformulations (aussi appellées opt-reformulations), narrowings, relaxations. Cette thèse concerne trois applications de la programmation mathématique où les reformulations ont été fondamentales pour obtenir une bonne solution. Le premier problème étudié est le partitionnement de graphes sur la base de la maximisation de la modularité. Comme ce problème est NP-difficile, plusieurs heuristiques sont proposées. On s'occupe d'un algorithme séparatif hiérarchique qui fonctionne en divisant récursivement une classe en deux nouvelles classes de façon optimale. Cet étape de division est accomplie en résolvant un programme binaire quadratique et convexe. Il est reformulé de manière exacte pour obtenir une forme plus compacte sans modifier l'ensemble des solutions optimales (exact reformulation). On considère aussi l'impact donné par la réduction du nombre des solutions symétriques globalement optimales. Les temps d'exécution sont considérablement réduits par rapport à la formulation originelle. Le deuxième problème étudié dans cette thèse est le placement de cercles égaux dans un carré (Packing Equal Circles in a Square, ou PECS), où l'on veut placer des cercles égaux dans un carré de côté 1 sans avoir de superposition et en maximisant le rayon commun. L'une des raisons pour laquelle le problème est difficile à résoudre vient de la présence de plusieurs solutions symétriques optimales, et par conséquent un arbre de séparation-et-évaluation (ou Branch-and-Bound) très large. Certaines solutions symétriques optimales sont rendues irréalisables en ajoutant des contraintes pour briser les symétries (Symmetry Breaking Constraints, ou SBCs) à la formulation, en obtenant ainsi un narrowing. Le temps d'exécution et la dimension de l'arbre de Branch-and-Bound sont tous les deux meilleurs par rapport à la formulation originelle. La troisième application considérée dans cette thèse est le calcul de la relaxation convexe pour des problèmes multilinéaires, et la comparaison de la formulation ''primale'' avec celle obtenue par une représentation ''duale''. Bien que ces deux relaxations soient déjà connues, il est intéressant de voir que la relaxation duale conduit à des meilleures performances de calcul.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bundfuss, Stefan. „Copositive matrices, copositive programming, and applications“. Tönning Lübeck Marburg Der Andere Verl, 2009. http://d-nb.info/994323700/04.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Programming applications"

Drake, Bob. Programming applications. Toronto: Copp Clark Pitman, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mathematical programming applications. New York: Macmillan, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Programming social applications. Sebastopol, CA: O'Reilly Media, 2011.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Programming HTML5 applications. Sebastopol, CA: O'Reilly Media, 2011.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Foster-Johnson, Eric, und Eric F. Johnson. X window applications programming. Portland, OR: Management Information Source, 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Johnsonbaugh, Richard. Applications programming in C. New York: Macmillan, 1990.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Core python applications programming. 3. Aufl. Upper Saddle River, NJ: Prentice Hall, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ada programming with applications. Boston: Allyn and Bacon, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Johnsonbaugh, Richard. Applications programming in C. New York: Collier MacMillan, 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vasilescu, Eugen N. Ada programming with applications. USA: W.C. Brown, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Programming applications"

Stancu-Minasian, I. M. „Fractional Programming Applications“. In Fractional Programming, 6–33. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-009-0035-6_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schniederjans, Marc J. „Goal Programming Applications“. In Goal Programming: Methodology and Applications, 73–100. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2229-4_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mössenböck, Hanspeter. „Typical Applications“. In Object-Oriented Programming, 75–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-97479-3_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harel, David, und Shani Nitzan. „Programming Animation Using Behavioral Programming“. In Behavior Modeling -- Foundations and Applications, 113–32. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21912-7_5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jungck, Peder, Ralph Duncan und Dwight Mulcahy. „Developing Large Applications in packetC“. In packetC Programming, 237–44. Berkeley, CA: Apress, 2011. http://dx.doi.org/10.1007/978-1-4302-4159-1_23.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Prékopa, András. „Special Cases and Selected Applications“. In Stochastic Programming, 447–500. Dordrecht: Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-017-3087-7_14.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hinze, Ralf, und Johan Jeuring. „Chapter 2. Generic Haskell: Applications“. In Generic Programming, 57–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45191-4_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Thy, Hoang. „Bilevel Linear Programming, Multiobjective Programming, and Monotonic Reverse Convex Programming“. In Multilevel Optimization: Algorithms and Applications, 295–314. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-0307-7_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Papajorgji, Petraq J., und Panos M. Pardalos. „Programming Paradigms“. In Springer Optimization and Its Applications, 3–8. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4899-7463-1_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Horst, Reiner, Panos M. Pardalos und Nguyen V. Thoai. „Quadratic Programming“. In Nonconvex Optimization and Its Applications, 49–107. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-0015-5_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Programming applications"

Guedes, Álan L. V., und Sergio Colcher. „Declarative programming of TV applications using NCL“. In Declarative Amsterdam. Amsterdam: John Benjamins, 2020. http://dx.doi.org/10.1075/da.2020.guedes.tv-application.

Der volle Inhalt der Quelle

Annotation:

Abstract NCL is the declarative programming language used to develop TV applications in IPTV systems and Terrestrial TV standardized by ITU and Brazilian TV Forum, respectively. Its main characteristics are: defining temporal synchronization among media assets and viewer interactions; layout reuse facilities; support multi-device presentation; support embed HTML code and scripts in the lightweight scripting language Lua; and an API for life-cycle controls (start, pause, resume, stop) and modifying applications on-the-fly called NCL editing command. This talk briefly introduces NCL, highlights its recent advances, and discuss the future of the language.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ioki, Masayuki, und Shigeru Chiba. „A Framework for Multiplatform HPC Applications“. In Programming Models and Applications. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/2578948.2560693.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Svensson, Hans, und Lars-Åke Fredlund. „Programming distributed erlang applications“. In the 2007 SIGPLAN workshop. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1292520.1292527.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tomcsanyiova, M., P. Tomcsanyi, R. Hrusecky und L' Salanci. „Programming little educational applications“. In 2016 International Conference on Emerging eLearning Technologies and Applications (ICETA). IEEE, 2016. http://dx.doi.org/10.1109/iceta.2016.7802093.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harnie, Dries, Theo D'Hondt, Elisa Gonzalez Boix und Wolfgang De Meuter. „Programming urban-area applications“. In the 27th Annual ACM Symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2245276.2232018.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mohanty, Siddharth, und Murray Cole. „Autotuning Wavefront Applications for Multicore Multi-GPU Hybrid Architectures“. In Programming Models and Applications. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/2578948.2560689.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sodsong, Wasuwee, Jingun Hong, Seongwook Chung, Yeongkyu Lim, Shin-Dug Kim und Bernd Burgstaller. „Dynamic Partitioning-based JPEG Decompression on Heterogeneous Multicore Architectures“. In Programming Models and Applications. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/2578948.2560684.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dennis, Jack B. „Compiling Fresh Breeze Codelets“. In Programming Models and Applications. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/2578948.2560691.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xu, Rengan, Xiaonan Tian, Yonghong Yan, Sunita Chandrasekaran und Barbara Chapman. „Reduction Operations in Parallel Loops for GPGPUs“. In Programming Models and Applications. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/2578948.2560692.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Wei, Guo Dong, Zhigang Deng, Guosun Zeng, Wei Liu und Huanliang Xiong. „Reachability Analysis of Cost-Reward Timed Automata for Energy Efficiency Scheduling“. In Programming Models and Applications. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/2578948.2560695.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Programming applications"

Ariyawansa, K. A. Stochastic Semidefinite Programming: Applications and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, März 2012. http://dx.doi.org/10.21236/ada573242.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Leininger, M. Finite State Tables for general computer programming applications. Office of Scientific and Technical Information (OSTI), Januar 1988. http://dx.doi.org/10.2172/5434347.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Richards, Mark A., und Daniel P. Campbell. Programming Methodology for High Performance Applications on Tiled Architectures. Fort Belvoir, VA: Defense Technical Information Center, Juni 2009. http://dx.doi.org/10.21236/ada501856.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Spector, Lee. Multi-Type Self Adaptive Genetic Programming for Complex Applications. Fort Belvoir, VA: Defense Technical Information Center, März 2005. http://dx.doi.org/10.21236/ada432974.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Oleynik, G. Object oriented design and programming for experiment online applications---Experiences with a prototype application. Office of Scientific and Technical Information (OSTI), März 1991. http://dx.doi.org/10.2172/5772278.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cook, R., E. Dube, I. Lee, C. Shereda, F. Wang und L. Nau. Survey of Novel Programming Models for Parallelizing Applications at Exascale. Office of Scientific and Technical Information (OSTI), November 2011. http://dx.doi.org/10.2172/1107306.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Owens, John. A Programming Framework for Scientific Applications on CPU-GPU Systems. Office of Scientific and Technical Information (OSTI), März 2013. http://dx.doi.org/10.2172/1069280.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Haney, Richard H., Song J. Park und Dale R. Shires. Building Task-Oriented Applications: An Introduction to the Legion Programming Paradigm. Fort Belvoir, VA: Defense Technical Information Center, Februar 2015. http://dx.doi.org/10.21236/ada613693.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pratt, K. C. Technical Note: Custom programming of image analysis applications for coal petrography. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1989. http://dx.doi.org/10.4095/126756.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nemhauser, George L. Applications of Mixed-Integer Programming to Problems of the U.S. Army. Fort Belvoir, VA: Defense Technical Information Center, März 1995. http://dx.doi.org/10.21236/ada295342.

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!