Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Routines“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Routines" 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 "Routines"
Guha, Mahua. „Routine responses to disruption of routines“. International Journal of Learning and Change 8, Nr. 2 (2015): 136. http://dx.doi.org/10.1504/ijlc.2015.074065.
Der volle Inhalt der QuelleMcConnell, S. „Why you should use routines...routinely“. IEEE Software 15, Nr. 4 (1998): 96, 94–95. http://dx.doi.org/10.1109/52.687957.
Der volle Inhalt der QuelleZhao, Zelin, Chuang Gan, Jiajun Wu, Xiaoxiao Guo und Joshua B. Tenenbaum. „Augmenting Policy Learning with Routines Discovered from a Single Demonstration“. Proceedings of the AAAI Conference on Artificial Intelligence 35, Nr. 12 (18.05.2021): 11024–32. http://dx.doi.org/10.1609/aaai.v35i12.17316.
Der volle Inhalt der QuelleMindell, Jodi, Erin Leichman und Katie Rotella. „0507 Prevalence and Components of Naptime vs. Bedtime Routines in Young Children“. Sleep 45, Supplement_1 (25.05.2022): A224. http://dx.doi.org/10.1093/sleep/zsac079.504.
Der volle Inhalt der QuelleRawstrone, Annette. „Routines“. Nursery World 2018, Nr. 14 (09.07.2018): 22–23. http://dx.doi.org/10.12968/nuwa.2018.14.22.
Der volle Inhalt der QuelleSegerberg, Krister. „Routines“. Synthese 65, Nr. 2 (November 1985): 185–210. http://dx.doi.org/10.1007/bf00869299.
Der volle Inhalt der QuelleWellbery, Caroline E. „Routines“. JAMA: The Journal of the American Medical Association 274, Nr. 4 (26.07.1995): 297. http://dx.doi.org/10.1001/jama.1995.03530040023016.
Der volle Inhalt der QuelleSalvato, Carlo, und Claus Rerup. „Routine Regulation: Balancing Conflicting Goals in Organizational Routines“. Administrative Science Quarterly 63, Nr. 1 (27.04.2017): 170–209. http://dx.doi.org/10.1177/0001839217707738.
Der volle Inhalt der QuelleStańczyk-Hugiet, Ewa. „Organizational Routines and Innovation: Micro and Macro Antecedents“. Journal of Management and Financial Sciences, Nr. 31 (29.07.2019): 99–110. http://dx.doi.org/10.33119/jmfs.2018.31.8.
Der volle Inhalt der QuelleHabib, Johanna, und Cathy Krohmer. „Balanced or unbalanced routines: the case of two routines dynamics in a French hospital“. Journal of Organizational Change Management 29, Nr. 4 (04.07.2016): 508–28. http://dx.doi.org/10.1108/jocm-11-2015-0212.
Der volle Inhalt der QuelleDissertationen zum Thema "Routines"
Dos, Santos Céline Calvarin Suzanne. „Les routines“. [S.l.] : [s.n.], 2009. http://castore.univ-nantes.fr/castore/GetOAIRef?idDoc=58491.
Der volle Inhalt der QuelleWelham, Robert Kenneth. „Optimal annual routines“. Thesis, University of Bristol, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268968.
Der volle Inhalt der QuelleJohnson, Michael Patrick 1971. „Evolving visual routines“. Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/61533.
Der volle Inhalt der QuelleRao, Satyajit 1965. „Visual routines and attention“. Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/49988.
Der volle Inhalt der QuelleJonsson, Jimmy. „SM-mästare - för att det var kul! : En kvalitativ studie om psykologiska framgångsfaktorer hos motocrossförare“. Thesis, Gymnastik- och idrottshögskolan, GIH, Institutionen för idrotts- och hälsovetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:gih:diva-2664.
Der volle Inhalt der QuelleTränarprogrammet 1995-1998
Gupta, Bharat. „HOW TO IMPROVE NONCONFORMITY ROUTINES“. Thesis, Växjö University, School of Technology and Design, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-890.
Der volle Inhalt der QuelleThis report is all about quality improvement work with focusing on nonconformities routines. The purpose is to improve the process of nonconformity routines and to identify the most important issues and causes behind nonconformity routines in order to have good quality of the products and satisfied customer to achieve continuous improvement. This project is conducted at a case study at the case company GMV Sweden AB producing lifts and their components. The problem in the case company is how the case company is handling nonconformity routines which consist currently of two streams one for problems in production which leads to internal nonconformities and another is handling customer complaints. The author visits the case company to collect essential information for this work and performs face-to-face user interviews, Q&A via email. The knowledge gained on different quality tools in author's education on Terotechnology department forms the basis of this research. The author plans to solve the problem by analyzing, mapping the existing processes and using different quality tools. The author analysis is based on theoretical and empirical facts, also different quality tools like process mapping, cause effect diagram, flowchart has been used to identify the problem and relevant suggestions have been proposed to improve their current situation. In the results and conclusions the author has explain the various improvement techniques and suggestions to handle internal nonconformities and customer complaints. The author believes by implementing the suggested improved model company can address their quality issues, which will improve the productivity to a greater extent and enable them to achieve their goal of continuous improvement.
Tellex, Stefanie 1980. „Grounding language in spatial routines“. Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37399.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 105-108).
This thesis describes a spatial language understanding system based on a lexicon of words defined in terms of spatial routines. A spatial routine is a script composed from a set of primitive operations on sensor data, analogous to Ullman's visual routines. By finding a set of primitives that underlie natural spatial language, the meaning of spatial terms can be succinctly expressed in a way that can be used to obey natural language commands. This hypothesis is tested by using spatial routines to build a natural language interface to a real time strategy game, in which a player controls an army of units in a battle. The system understands the meaning of context-dependent natural language commands such as "Run back!" and "Move the marines on top above the fiamethrowers on the bottom." In evaluation, the system successfully interpreted a range of spatial commands not seen during implementation, and exceeded the performance of a baseline system. Beyond real-time strategy games, spatial routines may provide the basis for interpreting spatial language in a broad range of physically situated language understanding systems, such as mobile robots or other computer game genres.
by Stefanie Tellex.
S.M.
Gossart, Cedric. „Routines and firm's HSE behaviour“. Thesis, University of Sussex, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.666767.
Der volle Inhalt der QuelleDe, Oliveira Steven. „Finding constancy in linear routines“. Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS207/document.
Der volle Inhalt der QuelleThe criticality of programs constantly reaches new boundaries as they are relied on to take decisions in place of the user (autonomous cars, robot surgeon, etc.). This raised the need to develop safe programs and to verify the already existing ones.Anyone willing to formally prove the soundness of a program faces the two challenges of scalability and undecidability. Million of lines of code, complexity of the algorithm, concurrency, and even simple polynomial expressions are part of the issues formal verification have to deal with. In order to succeed, formal methods rely on state abstraction to analyze approximations of the behavior of the analyzed program.The analysis of loops is a full axis of formal verification, as this construction is still today not well understood. Though some of them can be easily handled when they perform simple operations, there still exist some seemingly basic loops whose behavior has not been solved yet (the Syracuse sequence for example is suspected to be undecidable).The most common approach for the treatment of loops is the use of loop invariants, i.e. relations on variables that are true at the beginning of the loop and after every step. In general, invariants are expected to use the same set of expressions used in the loop: if a loop manipulates the memory on a structure for example, invariants will naturally use expressions involving memory operations. However, there exist loops containing only linear instructions that admit only polynomial invariants (for example, the sum on integers $sumlimits_{i=0}^n i$ can be computed by a linear loop and is a degree 2 polynomial in n), hence using expressions that are syntacticallyabsent of the loop. Is the previous remark wrong then ?This thesis presents new insights on loops containing linear and polynomial instructions. It is already known that linear loops are polynomially expressive, in the sense that if a variable evolves linearly, then any monomial of this variable evolves linearly. The first contribution of this thesis is the extraction of a class of polynomial loops that is exactly as expressive as linear loops, in the sense that there exist a linear loop with the exact same behavior. Then, two new methods for generating invariants are presented.The first method is based on abstract interpretation and is focused on a specific kind of linear loops called linear filters. Linear filters play a role in many embedded systems (plane sensors for example) and require the use of floating point operations, that may be imprecise and lead to errors if they are badly handled. Also, the presence of non deterministic assignments makes their analysis even more complex.The second method treats of a more generic subject by finding a complete set of linear invariants of linear loops that is easily computable. This technique is based on the linear algebra concept of eigenspace. It is extended to deal with conditions, nested loops and non determinism in assignments.Generating invariants is an interesting topic, but it is not an end in itself, it must serve a purpose. This thesis investigates the expressivity of invariantsgenerated by the second method by generating counter examples for the Kannan-Lipton Orbit problem.It also presents the tool PILAT implementing this technique and compares its efficiency technique with other state-of-the-art invariant synthesizers. The effective usefulness of the invariants generated by PILAT is demonstrated by using the tool in concert with CaFE, a model-checker for C programs based on temporal logics
Furneaux, Craig. „Variations on a routine : how selection-adaptation-retention dynamics create variety in organisational routines“. Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/52838/1/Craig_Furneaux_Thesis.pdf.
Der volle Inhalt der QuelleBücher zum Thema "Routines"
Ferlinghetti, Lawrence. Routines. New York, N.Y: New Directions, 2001.
Den vollen Inhalt der Quelle findenAnastassiou, George A., und Iuliana F. Iatan. Intelligent Routines. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5.
Der volle Inhalt der QuelleBelfer, Jhoanna. Morning Routines. [Long Beach, CA]: Jhoanna Belfer, 2020.
Den vollen Inhalt der Quelle findenBaßler, Moritz, Hrsg. Entsagung und Routines. Berlin, Boston: DE GRUYTER, 2013. http://dx.doi.org/10.1515/9783110331660.
Der volle Inhalt der QuellePriestley, Mark. Routines of Substitution. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91671-2.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. Intelligent Routines II. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01967-3.
Der volle Inhalt der QuelleMcLuckie, Keith, und Angus Barber. Sorting Routines for Microcomputers. London: Macmillan Education UK, 1986. http://dx.doi.org/10.1007/978-1-349-08147-9.
Der volle Inhalt der QuelleHandbook of organizational routines. Cheltenham, UK: Edward Elgar, 2008.
Den vollen Inhalt der Quelle findenBouisson, Jean-Claude Reinhardt Jean. VIEILLISSEMENT, RITES ET ROUTINES. Paris: Editions L'Harmattan, 2001.
Den vollen Inhalt der Quelle findenRules, routines, and regimentation. Bramcote Hills, Nottingham: Educational Heretics Press, 1996.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Routines"
Anastassiou, George A., und Iuliana F. Iatan. „Sequences and Series of Numbers“. In Intelligent Routines, 1–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_1.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Power Series“. In Intelligent Routines, 41–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_2.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Differentiation Theory of the Functions“. In Intelligent Routines, 71–156. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_3.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Fundamentals of Field Theory“. In Intelligent Routines, 157–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_4.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Implicit Functions“. In Intelligent Routines, 187–244. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_5.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Terminology about Integral Calculus“. In Intelligent Routines, 245–316. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_6.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Equations and Systems of Linear Ordinary Differential Equations“. In Intelligent Routines, 317–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_7.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Line and Double Integral Calculus“. In Intelligent Routines, 395–474. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_8.
Der volle Inhalt der QuelleAnastassiou, George A., und Iuliana F. Iatan. „Triple and Surface Integral Calculus“. In Intelligent Routines, 475–572. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-28475-5_9.
Der volle Inhalt der QuelleRach, Ruth, und Brian Hill. „Routines“. In Breakthrough German 2, 81–96. London: Macmillan Education UK, 1998. http://dx.doi.org/10.1007/978-1-349-26501-5_6.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Routines"
Jáuregui, Juan Carlos, Rodrigo López Sansalvador, Alfredo Ramos Aparicio und Isaías Regalado Contreras. „Software for Optimum Gear Design (DISENG)“. In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0288.
Der volle Inhalt der QuelleMoreira, Waldir, Paulo Mendes und Susana Sargento. „Opportunistic routing based on daily routines“. In 2012 IEEE Thirteenth International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM). IEEE, 2012. http://dx.doi.org/10.1109/wowmom.2012.6263749.
Der volle Inhalt der QuelleToreja, Allen J., und Rizwan-Uddin. „Improving the Efficiency of the Nodal Integral Method With the Portable, Extensible Toolkit for Scientific Computation“. In 10th International Conference on Nuclear Engineering. ASMEDC, 2002. http://dx.doi.org/10.1115/icone10-22684.
Der volle Inhalt der QuelleUllman, Shimon. „Visual routines“. In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.thc4.
Der volle Inhalt der QuelleZhang, Yong, und John M. Sullivan. „Continuous Temporal and Spatial Finite Element Boundary Condition Assignments Using a Neural Network Prediction System“. In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/cie-14659.
Der volle Inhalt der QuelleLambert, D. A. „Automating cognitive routines“. In Proceedings of the Sixth International Conference of Information Fusion. IEEE, 2003. http://dx.doi.org/10.1109/icif.2003.177347.
Der volle Inhalt der QuelleVAN TONDER, G. J., und Y. EJIMA. „IMPLEMENTATION OF VISUAL ROUTINES“. In Proceedings of the Seventh Neural Computation and Psychology Workshop. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777256_0015.
Der volle Inhalt der QuelleAfrin, Tahera. „Resilience in Daily Routines for Children with Autism“. In 2021 ITP Research Symposium. Unitec ePress, 2022. http://dx.doi.org/10.34074/proc.2205014.
Der volle Inhalt der QuelleMegale, Felipe M., und Felipe D. Cunha. „Exploring Routines in Vehicular Networks“. In MSWiM '20: 23rd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3416012.3424618.
Der volle Inhalt der QuelleOliveira, Westerley, Michael Canesche, Lucas Reis, José Nacif und Ricardo Ferreira. „Design Exploration of Machine Learning Data-Flows onto Heterogeneous Reconfigurable Hardware“. In XXI Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/wscad.2020.14063.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Routines"
Danuskhkodi, Vaiyapuri. Development of Geodetic Conversion Routines. Fort Belvoir, VA: Defense Technical Information Center, September 2001. http://dx.doi.org/10.21236/ada396043.
Der volle Inhalt der QuelleKlimes, L. Complete ray tracing Fortran77 routines. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1990. http://dx.doi.org/10.4095/130830.
Der volle Inhalt der QuelleDonato, J. M., und G. A. Geist. Collective communication routines in PVM. Office of Scientific and Technical Information (OSTI), Mai 1996. http://dx.doi.org/10.2172/254958.
Der volle Inhalt der QuelleAlleva, D. VFI: VME/FASTBUS Interface routines. Office of Scientific and Technical Information (OSTI), September 1987. http://dx.doi.org/10.2172/5793542.
Der volle Inhalt der QuelleAlleva, D. SVI: Super-VIOR interface routines. Office of Scientific and Technical Information (OSTI), Oktober 1987. http://dx.doi.org/10.2172/5876413.
Der volle Inhalt der QuelleAlleva, D. VTI: VME/CIPRICO Interface routines. Office of Scientific and Technical Information (OSTI), September 1987. http://dx.doi.org/10.2172/5876415.
Der volle Inhalt der QuelleBooth, Victoria. Small and Great Circle Routines. Fort Belvoir, VA: Defense Technical Information Center, Juli 1989. http://dx.doi.org/10.21236/ada217652.
Der volle Inhalt der QuelleWhite, J. A. Multiple electron scattering routines for PEREGRINE. Office of Scientific and Technical Information (OSTI), August 1999. http://dx.doi.org/10.2172/14916.
Der volle Inhalt der QuelleEisler, G. R., und P. W. Fuerschbach. SOAR: Smartweld optimization and analysis routines. Office of Scientific and Technical Information (OSTI), Oktober 1996. http://dx.doi.org/10.2172/412335.
Der volle Inhalt der QuelleAlleva, D. VII: VME/IORFI-II interface routines. Office of Scientific and Technical Information (OSTI), Juli 1988. http://dx.doi.org/10.2172/6821207.
Der volle Inhalt der Quelle