Gotowe bibliografie tematyczne / Programming

Gotowa bibliografia na temat „Programming”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 31 sierpnia 2024

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

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł 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.

Artykuły w czasopismach na temat "Programming"

1

El-Zakhem, Imad H. "Socratic Programming: An Innovative Programming Learning Method". International Journal of Information and Education Technology 6, nr 3 (2016): 247–50. http://dx.doi.org/10.7763/ijiet.2016.v6.694.

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

COLLIS, D. "Programming Programming". Science 254, nr 5031 (25.10.1991): 589–90. http://dx.doi.org/10.1126/science.254.5031.589.

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

Wheatman, Martin. "Programming Without Programming". ITNOW 60, nr 1 (2018): 56–57. http://dx.doi.org/10.1093/itnow/bwy025.

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

Shukla, Abhishek. "Bridging the Gap between Event-Based Programming and Functional Programming". International Journal of Science and Research (IJSR) 11, nr 1 (5.01.2022): 1595–98. http://dx.doi.org/10.21275/sr231116134821.

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

Roque Hernández, Ramón Ventura, Sergio Armando Guerra Moya i Frida Carmina Caballero Rico. "Acceptance and Assessment in Student Pair-Programming: A Case Study". International Journal of Emerging Technologies in Learning (iJET) 16, nr 09 (4.05.2021): 4. http://dx.doi.org/10.3991/ijet.v16i09.18693.

Pełny tekst źródła
Streszczenie:
This study analyzes pair programming's acceptance and assessment in the university setting considering participants' gender, previous programming ex-perience, and programming enjoyment. The sample included 80 students from three different sections enrolled in a basic programming course. We used a questionnaire to collect data after the pair programming practices. For data analysis, we used SPSS 24, and Mann-Whitney, Kruskal-Wallis, and Jonckheere-Terpstra statistical techniques. Descriptive and comparative re-sults showed a significant increasing monotonic trend in the acceptance of pair programming as students' preference toward programming increased (standardized statistic = 3.20, p = 0.00, Kendall's τb = 0.30, p = 0.001). Also, pair programming was positively accepted and assessed even by students who reported a low level of programming enjoyment. There were no other statistically significant results.
Style APA, Harvard, Vancouver, ISO itp.
6

Voronkov, A. A. "Logic programming and ?-programming". Cybernetics 25, nr 1 (1989): 83–91. http://dx.doi.org/10.1007/bf01074888.

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

Сальков i Nikolay Sal'kov. "Graph-analytic Solution of Some Special Problems of Quadratic Programming". Geometry & Graphics 2, nr 1 (3.03.2014): 3–8. http://dx.doi.org/10.12737/3842.

Pełny tekst źródła
Streszczenie:
Quadratic programming problems are one of special cases of mathematical programming problems. Mathematical programming problems solution is of great importance, because these problems are those of optimizing of solution related to presented issues from multitude of possible ones. The mathematical programming problems are linear, nonlinear, dynamic and others. It is suggested to consider a graph-analytic solution of quadratic programming’s special problems, which, taken together, constitute the quadratic programming problems for two and three variables. A total of eight special problems have been considered.
Style APA, Harvard, Vancouver, ISO itp.
8

HUANG, HONG-ZHONG, ZHI-GANG TIAN i YING-KUI GU. "RELIABILITY AND REDUNDANCY APPORTIONMENT OPTIMIZATION USING INTERACTIVE PHYSICAL PROGRAMMING". International Journal of Reliability, Quality and Safety Engineering 11, nr 03 (wrzesień 2004): 213–22. http://dx.doi.org/10.1142/s0218539304001476.

Pełny tekst źródła
Streszczenie:
In this paper, a new multiobjective optimization approach named interactive physical programming is proposed and used to solve the reliability and redundancy apportionment optimization problem. Interactive physical programming extends physical programming6 to an interactive framework. After the designer specifies which objectives need to be improved and which objectives can be sacrificed, interactive physical programming can obtain the Pareto solutions satisfying such improving preferences. It has good convergence performance, and can obtain satisfactory design in the end. Interactive physical programming has been successfully applied to a reliability and redundancy apportionment optimization problem. It provides a new effective approach for reliability optimization.
Style APA, Harvard, Vancouver, ISO itp.
9

Gilmore, D. J., i T. R. G. Green. "Programming Plans and Programming Expertise". Quarterly Journal of Experimental Psychology Section A 40, nr 3 (sierpień 1988): 423–42. http://dx.doi.org/10.1080/02724988843000005.

Pełny tekst źródła
Streszczenie:
This paper addresses issues of the nature of expertise in programming and asks whether “programming plans” represent the underlying deep structure of a program. It reports an experiment that investigated the effect, on experienced programmers, of highlighting the plan structure of a computer program, while they were performing both plan-related and unrelated tasks. The effect was examined in both Pascal and BASIC. For Pascal programmers, perceptual cues to the plan structure were useful only for plan-related tasks, but the same cues were of no benefit to experienced BASIC programmers in any of the tasks. These results suggest that the actual content of programming plans does not generalise across different languages, although it is possible that the BASIC programmers can use other plans. From these results a more detailed description of programming plans and their role in programming expertise can be developed. The fact that BASIC programmers were not sensitive to the same plans as Pascal programmers implies that plans cannot represent the underlying deep structure of the programming problem.
Style APA, Harvard, Vancouver, ISO itp.
10

Goodell, Howie, Sarah Kuhn, David Maulsby i Carol Traynor. "End user programming/informal programming". ACM SIGCHI Bulletin 31, nr 4 (październik 1999): 17–21. http://dx.doi.org/10.1145/339290.339294.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Programming"

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 a set of definitions (a definitive script) and a state transition is represented by a redefinition. By means of a definition, a variable is defined either by an explicit value or by a formula in terms of other variables. Unless this variable is redefined, the relationship between the variables within the definition persists. To apply this state representation principle, we have developed some definitive notations in which the underlying algebras used in formulating definitions are domain specific. We have also developed an agent-oriented specification language by which we can model state transitions over definitive scripts. The modelling principles of definitive programming rest on a solid foundation in observation and experiment that is essential for exploratory software development. This thesis describes how we may combine definitive notations and the agent oriented programming concept to produce software tools that are useful in exploratory software development. In this way, definitive programming can be considered as a paradigm for exploratory programming.
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 to the problems. Secondly we present an extension of the Local Cut procedure introduced by Applegate et al, 2001, for the Symmetric Traveling Salesman Problem (STSP), to the general setting of MIP problems. This extension also proves finiteness of the separation, facet and tilting procedures in the general MIP setting, and also provides conditions under which the separation procedure is guaranteed to generate cuts that separate the current fractional solution from the convex hull of the mixed-integer polyhedron. We then move on to explore some configurations for local cuts, realizing extensive testing on the instances from MIPLIB. Those results show that this technique may be useful in general MIP problems, while the experience of Applegate et al, shows that the ideas can be successfully applied to structures problems as well. Thirdly we present an extensive computational experiment on the TSP and Domino Parity inequalities as introduced by Letchford, 2000. This work also include a safe-shrinking theorem for domino parity inequalities, heuristics to apply the planar separation algorithm introduced by Letchford to instances where the planarity requirement does not hold, and several practical speed-ups. Our computational experience showed that this class of inequalities effectively improve the lower bounds from the best relaxations obtained with Concorde, which is one of the state of the art solvers for the STSP. As part of these experience, we solved to optimality the (up to now) largest two STSP instances, both of them belong to the TSPLIB set of instances and they have 18,520 and 33,810 cities respectively.
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.

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-8 when the machine precision on a 32-bit computer is approximately 10-16.

We then propose a simple alternative approach for the normal equation based interior-point method. This approach has better numerical stability than the normal equation based method. Although, our approach is not competitive in terms of CPU time for the NETLIB problem set, we do obtain higher accuracy. In addition, we obtain significantly smaller CPU times compared to the normal equation based direct solver, when we solve well-conditioned, huge, and sparse problems by using our iterative based linear solver. Additional techniques discussed are: crossover; purification step; and no backtracking.

Finally, we present an algorithm to construct SDP problem instances with prescribed strict complementarity gaps. We then introduce two measures of strict complementarity gaps. We empirically show that: (i) these measures can be evaluated accurately; (ii) the size of the strict complementarity gaps correlate well with the number of iteration for the SDPT3 solver, as well as with the local asymptotic convergence rate; and (iii) large strict complementarity gaps, coupled with the failure of Slater's condition, correlate well with loss of accuracy in the solutions. In addition, the numerical tests show that there is no correlation between the strict complementarity gaps and the geometrical measure used in [31], or with Renegar's condition number.
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 increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.
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 synchronous access to JavaScript's asynchronous APIs. The results of this work are used toward two projects: (1) a programming environment called WeScheme that runs in the web browser and supports a functional programming curriculum, and (2) a tool-chain called Moby that compiles event-driven functional programs to smartphones, with access to phone-specific features.
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 programming concepts in programming courses starting from the introductory courses. By evaluating the students' security consideration and knowledge regarding software security. As a result, based on the knowledge students lack regarding software security, security and secure programming concepts are identified which need to be integrated into the programming courses.
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) and lines (representing data flow). The secondary view is a textual one, in which the program is presented as a collection of written function definitions. It is expected that the end-user programmer will begin with the visual view, perhaps later moving on to the textual view. The task of the programming system is to ensure that the visual and textual views are kept consistent as the program is constructed. The foundation of the programming system is a implementation of the Model-View-Controller (MVC) design pattern as a reactive program using the elegant Functional Reactive Programming (FRP) framework. Human-Computer Interaction (HCI) principles and methods are considered in all design decisions. A usabilty study was made to �find out the effectiveness of the new system.
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 analysis. We have obtained various constraint qualifications and stationarity conditions depending on some constructive representations of the solution set-valued mapping of the follower’s problem. In the auxiliary developments, we have provided rules for the generalized differentiation and robust Lipschitzian properties for the lower-level solution setvalued map, which are of a fundamental interest for other areas of nonlinear and nonsmooth optimization. Some of the results of the aforementioned theory have then been applied to derive stationarity conditions for some well-known transportation problems having the bilevel structure.
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 feasible region. Finally the numerical examples and their solutions are attached to provide explanations of procedures.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Programming"

1

Open University. Programming and Programming Languages Course Team., red. Programming and programming languages. Milton Keynes: Open University Press, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Open University. Programming and Programming Languages Course Team., red. Programming and programming languages. Milton Keynes: Open University Press, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Richard, Mansfield. Programming. New York: McGraw-Hill, 2009.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Barichard, Vincent, Matthias Ehrgott, Xavier Gandibleux i Vincent T'Kindt, red. Multiobjective Programming and Goal Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-85646-7.

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

Harvey, Abramson, Rogers M. H. 1930- i META88 (1988 : University of Bristol), red. Meta-programming in logic programming. Cambridge, Mass: MIT Press, 1989.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Pearce, Jon. Programming and Meta-Programming in Scheme. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1682-7.

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

Deransart, Pierre, i Jan Maluszyński, red. Programming Language Implementation and Logic Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/bfb0024171.

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

Maluszyński, Jan, i Martin Wirsing, red. Programming Language Implementation and Logic Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54444-5.

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

Tanino, Tetsuzo, Tamaki Tanaka i Masahiro Inuiguchi. Multi-Objective Programming and Goal Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36510-5.

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

Deransart, P., B. Lorho i J. Małuszyński, red. Programming Languages Implementation and Logic Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-50820-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Programming"

1

Wang, Lin. "Mathematical Programming, Linear Programming". W Encyclopedia of Systems Biology, 1187. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_406.

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

Fox, Richard. "Programming and Programming Languages". W Information Technology, 285–327. Second edition. | Boca Raton : CRC Press, 2020.: Chapman and Hall/CRC, 2020. http://dx.doi.org/10.1201/9781003050971-8.

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

Kalkan, Sinan, Onur T. Şehitoğlu i Göktürk Üçoluk. "Programming and Programming Languages". W Programming with Python for Engineers, 19–33. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57148-0_2.

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

Kaufmann, Stephan. "Programming". W Mathematica as a Tool, 329–93. Basel: Birkhäuser Basel, 1994. http://dx.doi.org/10.1007/978-3-0348-8526-3_4.

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

Steinmetz, Ralf, i Klara Nahrstedt. "Programming". W X.media.publishing, 23–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-08876-0_3.

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

Krause, Andreas, i Melvin Olson. "Programming". W The Basics of S and S-Plus, 163–96. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4757-2751-7_8.

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

Britz, Dieter, i Jörg Strutwolf. "Programming". W Monographs in Electrochemistry, 421–25. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30292-8_16.

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

Jenkins, Tony, i Graham Hardman. "Programming". W How to Program Using Java, 11–19. London: Macmillan Education UK, 2004. http://dx.doi.org/10.1007/978-0-230-80243-8_2.

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

Tang, Weifeng. "Programming". W Transforming Domain into Boundary Integrals in BEM, 194–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-83465-3_5.

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

Egges, Arjan. "Programming". W Building JavaScript Games, 3–18. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4302-6539-9_1.

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

Streszczenia konferencji na temat "Programming"

1

Parsons, Mark I., i Francis W. Wray. "Programming FPGAs---Programming FPGAs". W the 2006 ACM/IEEE conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1188455.1188481.

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

Hassinen, Marko, i Hannu Mäyrä. "Learning programming by programming". W the 6th Baltic Sea conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1315803.1315824.

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

Lämmel, Ralf, Eelco Visser i Joost Visser. "Strategic programming meets adaptive programming". W the 2nd international conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/643603.643621.

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

Hermans, Felienne, i Marlies Aldewereld. "Programming is Writing is Programming". W Programming '17: International Conference on the Art, Science, and Engineering of Programming. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3079368.3079413.

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

Igwe, Kevin, i Nelishia Pillay. "Automatic programming using genetic programming". W 2013 Third World Congress on Information and Communication Technologies (WICT). IEEE, 2013. http://dx.doi.org/10.1109/wict.2013.7113158.

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

Velbitskiy, Igor. "Programming without Programming Languages New Graphic Polyglot Concept of Programming". W 2016 6th International Conference on IT Convergence and Security (ICITCS). IEEE, 2016. http://dx.doi.org/10.1109/icitcs.2016.7740364.

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

Dantas, Danilo Medeiros, Jucelio Soares dos Santos, Kézia de Vasconcelos Oliveira Dantas, Wilkerson L. Andrade, João Brunet i Monilly Ramos Araujo Melo. "Screening Programming’s Reliability to Measure Predictive Programming Skills". W Simpósio Brasileiro de Informática na Educação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/sbie.2023.235112.

Pełny tekst źródła
Streszczenie:
This study aimed to evaluate the reliability of an item bank developed in the Screening Programming system for measuring predictive programming skills. The results revealed that the selected items showed good content analysis and consistent psychometric properties. Furthermore, the instruments created from this item bank demonstrated good reliability in professional assessments, validating their accuracy and stability across different contexts and populations. These findings contribute to the programming field by providing a reliable instrument for assessing and developing predictive skills in this domain, fostering continuous advancements in understanding and teaching these skills.
Style APA, Harvard, Vancouver, ISO itp.
8

Teague, Donna, i Raymond Lister. "Programming". W the 2014 conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2591708.2591712.

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

Bergin, Susan, i Ronan Reilly. "Programming". W the 36th SIGCSE technical symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1047344.1047480.

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

Plaice, John, i Blanca Mancilla. "Cartesian Programming: The TransLucid Programming Language". W 2009 33rd Annual IEEE International Computer Software and Applications Conference. IEEE, 2009. http://dx.doi.org/10.1109/compsac.2009.139.

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

Raporty organizacyjne na temat "Programming"

1

Cai, Yongyang, Kenneth Judd, Thomas Lontzek, Valentina Michelangeli i Che-Lin Su. Nonlinear Programming Method for Dynamic Programming. Cambridge, MA: National Bureau of Economic Research, maj 2013. http://dx.doi.org/10.3386/w19034.

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

Bixby, Robert E. Linear Programming Tools for Integer Programming. Fort Belvoir, VA: Defense Technical Information Center, październik 1989. http://dx.doi.org/10.21236/ada219013.

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

Manna, Zohar. Deductive Programming. Fort Belvoir, VA: Defense Technical Information Center, listopad 1988. http://dx.doi.org/10.21236/ada202489.

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

Daniel, David J., Allen Mc Pherson, John R. Thorp, Richard Barrett, Robert Clay, Bronis De Supinski, Evi Dube i in. Programming models. Office of Scientific and Technical Information (OSTI), styczeń 2011. http://dx.doi.org/10.2172/1047128.

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

Taylor, Steven. Scalable Concurrent Programming Project, Scalable Concurrent Programming Laboratory. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1996. http://dx.doi.org/10.21236/ada315138.

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

Bixby, Robert. Linear-Programming Tools in Integer Programming: The Traveling Salesman. Fort Belvoir, VA: Defense Technical Information Center, październik 1992. http://dx.doi.org/10.21236/ada261398.

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

Manna, Zohar. Deductive Programming Synthesis. Fort Belvoir, VA: Defense Technical Information Center, marzec 1989. http://dx.doi.org/10.21236/ada206451.

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

Hu, Hui. Semi-Infinite Programming. Fort Belvoir, VA: Defense Technical Information Center, marzec 1989. http://dx.doi.org/10.21236/ada207403.

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

Partow, Perry. Scalable Programming Environment. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1994. http://dx.doi.org/10.21236/ada286390.

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

Kiczales, Gregor, James Hugunin, Erik Hilsdale, Mik Kersten i Jeff Palm. Aspect Oriented Programming. Fort Belvoir, VA: Defense Technical Information Center, lipiec 2003. http://dx.doi.org/10.21236/ada417906.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Programming” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
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!

Do bibliografii