Gotowe bibliografie tematyczne / Sequential processing (Computer science)

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Sequential processing (Computer science)”

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

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

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Sequential processing (Computer science)”.

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 "Sequential processing (Computer science)"

1

Carmesin, H. O., i H. Schwegler. "Parallel versus sequential processing of relational stimulus structures". Biological Cybernetics 71, nr 6 (październik 1994): 523–29. http://dx.doi.org/10.1007/bf00198470.

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

Carmesin, H. O., i H. Schwegler. "Parallel versus sequential processing of relational stimulus structures". Biological Cybernetics 71, nr 6 (1.10.1994): 523–29. http://dx.doi.org/10.1007/s004220050111.

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

Lee, Yong-Joo, i Paul Zipkin. "Processing Networks with Inventories: Sequential Refinement Systems". Operations Research 43, nr 6 (grudzień 1995): 1025–36. http://dx.doi.org/10.1287/opre.43.6.1025.

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

Korde, P. S., i P. B. Khanale. "Cache Oblivious Matrix Multiplication Algorithm using Sequential Access Processing". Research Journal of Information Technology 3, nr 1 (1.01.2011): 61–67. http://dx.doi.org/10.3923/rjit.2011.61.67.

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

Sharma, Shalini, i Angshul Majumdar. "Sequential Transform Learning". ACM Transactions on Knowledge Discovery from Data 15, nr 5 (26.06.2021): 1–18. http://dx.doi.org/10.1145/3447394.

Pełny tekst źródła
Streszczenie:
This work proposes a new approach for dynamical modeling; we call it sequential transform learning. This is loosely based on the transform (analysis dictionary) learning formulation. This is the first work on this topic. Transform learning, was originally developed for static problems; we modify it to model dynamical systems by introducing a feedback loop. The learnt transform coefficients for the t th instant are fed back along with the t + 1st sample, thereby establishing a Markovian relationship. Furthermore, the formulation is made supervised by the label consistency cost. Our approach keeps the best of two worlds, marrying the interpretability and uncertainty measure of signal processing with the function approximation ability of neural networks. We have carried out experiments on one of the most challenging problems in dynamical modeling - stock forecasting. Benchmarking with the state-of-the-art has shown that our method excels over the rest.
Style APA, Harvard, Vancouver, ISO itp.
6

LeBron Paige, A., Ö. Özdamar i R. E. Delgado. "Two-dimensional spectral processing of sequential evoked potentials". Medical & Biological Engineering & Computing 34, nr 3 (maj 1996): 239–43. http://dx.doi.org/10.1007/bf02520080.

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

ROBERGE, VINCENT, i MOHAMMED TARBOUCHI. "COMPARISON OF PARALLEL PARTICLE SWARM OPTIMIZERS FOR GRAPHICAL PROCESSING UNITS AND MULTICORE PROCESSORS". International Journal of Computational Intelligence and Applications 12, nr 01 (marzec 2013): 1350006. http://dx.doi.org/10.1142/s1469026813500065.

Pełny tekst źródła
Streszczenie:
In this paper, we present a parallel implementation of the particle swarm optimization (PSO) on graphical processing units (GPU) using CUDA. By fully utilizing the processing power of graphic processors, our implementation (CUDA-PSO) provides a speedup of 167× compared to a sequential implementation on CPU. This speedup is significantly superior to what has been reported in recent papers and is achieved by four optimizations we made to better adapt the parallel algorithm to the specific architecture of the NVIDIA GPU. However, because today's personal computers are usually equipped with a multicore CPU, it may be unfair to compare our CUDA implementation to a sequential one. For this reason, we implemented a parallel PSO for multicore CPUs using MPI (MPI-PSO) and compared its performance against our CUDA-PSO. The execution time of our CUDA-PSO remains 15.8× faster than our MPI-PSO which ran on a high-end 12-core workstation. Moreover, we show with statistical significance that the results obtained using our CUDA-PSO are of equal quality as the results obtained by the sequential PSO or the MPI-PSO. Finally, we use our parallel PSO for real-time harmonic minimization of multilevel power inverters with 20 DC sources while considering the first 100 harmonics and show that our CUDA-PSO is 294× faster than the sequential PSO and 32.5× faster than our parallel MPI-PSO.
Style APA, Harvard, Vancouver, ISO itp.
8

Zhuo, Youwei, Jingji Chen, Gengyu Rao, Qinyi Luo, Yanzhi Wang, Hailong Yang, Depei Qian i Xuehai Qian. "Distributed Graph Processing System and Processing-in-memory Architecture with Precise Loop-carried Dependency Guarantee". ACM Transactions on Computer Systems 37, nr 1-4 (czerwiec 2021): 1–37. http://dx.doi.org/10.1145/3453681.

Pełny tekst źródła
Streszczenie:
To hide the complexity of the underlying system, graph processing frameworks ask programmers to specify graph computations in user-defined functions (UDFs) of graph-oriented programming model. Due to the nature of distributed execution, current frameworks cannot precisely enforce the semantics of UDFs, leading to unnecessary computation and communication. It exemplifies a gap between programming model and runtime execution. This article proposes novel graph processing frameworks for distributed system and Processing-in-memory (PIM) architecture that precisely enforces loop-carried dependency; i.e., when a condition is satisfied by a neighbor, all following neighbors can be skipped. Our approach instruments the UDFs to express the loop-carried dependency, then the distributed execution framework enforces the precise semantics by performing dependency propagation dynamically. Enforcing loop-carried dependency requires the sequential processing of the neighbors of each vertex distributed in different nodes. We propose to circulant scheduling in the framework to allow different nodes to process disjoint sets of edges/vertices in parallel while satisfying the sequential requirement. The technique achieves an excellent trade-off between precise semantics and parallelism—the benefits of eliminating unnecessary computation and communication offset the reduced parallelism. We implement a new distributed graph processing framework SympleGraph, and two variants of runtime systems— GraphS and GraphSR —for PIM-based graph processing architecture, which significantly outperform the state-of-the-art.
Style APA, Harvard, Vancouver, ISO itp.
9

CHANG, C. Y., i K. YAO. "SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM". International Journal of High Speed Computing 01, nr 03 (wrzesień 1989): 465–80. http://dx.doi.org/10.1142/s0129053389000251.

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

KRITHIVASAN, KAMALA, N. SAKTHI BALAN i PRAHLADH HARSHA. "DISTRIBUTED PROCESSING IN AUTOMATA". International Journal of Foundations of Computer Science 10, nr 04 (grudzień 1999): 443–63. http://dx.doi.org/10.1142/s0129054199000319.

Pełny tekst źródła
Streszczenie:
With distributed computing beginning to play a major role in modern Computer Science, the theory of grammar systems and distributed automata has been developed in order to model distributed computing. In this paper, we introduce the notion of distributed automata in the sequential sense. Distributed Automata are a group of automata working in unison to accept one language. We build the theory of distributed for FSA and PDA in different modes of acceptance like the t-mode, *-mode, =k-mode, ≤k-mode and ≥k-mode. We then analyze the acceptance power of each automata in all the above modes. We present proofs that distributed FSAs do not have any additional power over "centralized" FSAs in any of the modes, while distributed PDAs with only two components are as powerful as Turing Machines in all of the modes. We give proofs for the equivalence of all modes in the case of PDAs. We also study a restricted version of distributed PDA called k-turn distributed PDA.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Sequential processing (Computer science)"

1

Parashkevov, Atanas. "Advances in space and time efficient model checking of finite state systems". Title page, contents and abstract only, 2002. http://web4.library.adelaide.edu.au/theses/09PH/09php223.pdf.

Pełny tekst źródła
Streszczenie:
Bibliography: leaves 211-220 This thesis examines automated formal verification techniques and their associated space and time implementation complexity when applied to finite state concurrent systems. The focus is on concurrent systems expressed in the Communicating Sequential Processes (CSP) framework. An approach to the compilation of CSP system descriptions into boolean formulae in the form of Ordered Binary Decision Diagrams (OBDD) is presented, further utilised by a basic algorithm that checks a refinement or equivalence relation between a pair of processes in any of the three CSP semantic models. The performance bottlenecks of the basic refinement checking algorithms are identified and addressed with the introduction of a number of novel techniques and algorithms. Algorithms described in this thesis are implemented in the Adelaide Tefinement Checking Tool.
Style APA, Harvard, Vancouver, ISO itp.
2

Bari, Himanshu. "Design and implementation of a library to support the Common Component Architecture (CCA) over Legion". Diss., Online access via UMI:, 2004. http://wwwlib.umi.com/dissertations/fullcit/1424173.

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

Zhang, Shujian. "Evaluation in built-in self-test". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ34293.pdf.

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

Moffat, Nicholas. "Identifying and exploiting symmetry for CSP refinement checking". Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711620.

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

Pajic, Slobodan. "Sequential quadratic programming-based contingency constrained optimal power flow". Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0430103-152758.

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

Simpson, Andrew C. "Safety through security". Thesis, University of Oxford, 1996. http://ora.ox.ac.uk/objects/uuid:4a690347-46af-42a4-91fe-170e492a9dd1.

Pełny tekst źródła
Streszczenie:
In this thesis, we investigate the applicability of the process algebraic formal method Communicating Sequential Processes (CSP) [Hoa85] to the development and analysis of safetycritical systems. We also investigate how these tasks might be aided by mechanical verification, which is provided in the form of the proof tool Failures-Divergences Refinement (FDR) [Ros94]. Initially, we build upon the work of [RWW94, Ros95], in which CSP treatments of the security property of non-interference are described. We use one such formulation to define a property called protection, which unifies our views of safety and security. As well as applying protection to the analysis of safety-critical systems, we develop a proof system for this property, which in conjunction with the opportunity for automated analysis provided by FDR, enables us to apply the approach to problems of a sizable complexity. We then describe how FDR can be applied to the analysis of mutual exclusion, which is a specific form of non-interference. We investigate a number of well-known solutions to the problem, and illustrate how such mutual exclusion algorithms can be interpreted as CSP processes and verified with FDR. Furthermore, we develop a means of verifying the faulttolerance of such algorithms in terms of protection. In turn, mutual exclusion is used to describe safety properties of geographic data associated with Solid State Interlocking (SSI) railway signalling systems. We show how FDR can be used to describe these properties and model interlocking databases. The CSP approach to compositionality allows us to decompose such models, thus reducing the complexity of analysing safety invariants of SSI geographic data. As such, we describe how the mechanical verification of Solid State Interlocking geographic data, which was previously considered to be an intractable problem for the current generation of mechanical verification tools, is computationally feasible using FDR. Thus, the goals of this thesis are twofold. The first goal is to establish a formal encapsulation of a theory of safety-critical systems based upon the relationship which exists between safety and security. The second goal is to establish that CSP, together with FDR, can be applied to the modelling of Solid State Interlocking geographic databases. Furthermore, we shall attempt to demonstrate that such modelling can scale up to large-scale systems.
Style APA, Harvard, Vancouver, ISO itp.
7

Koufogiannakis, Christos. "Approximation algorithms for covering problems". Diss., [Riverside, Calif.] : University of California, Riverside, 2009. http://proquest.umi.com/pqdweb?index=0&did=1957320821&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1268338860&clientId=48051.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--University of California, Riverside, 2009.
Includes abstract. Title from first page of PDF file (viewed March 11, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 70-77). Also issued in print.
Style APA, Harvard, Vancouver, ISO itp.
8

Bari, Wasimul. "Analyzing binary longitudinal data in adaptive clinical trials /". Internet access available to MUN users only, 2003. http://collections.mun.ca/u?/theses,167453.

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

Thomas, Jonathan. "Asynchronous Validity Resolution in Sequentially Consistent Shared Virtual Memory". Fogler Library, University of Maine, 2001. http://www.library.umaine.edu/theses/pdf/Thomas.pdf.

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

Shao, Yang. "Sequential organization in computational auditory scene analysis". Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1190127412.

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

Książki na temat "Sequential processing (Computer science)"

1

Kronsjö, Lydia I. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1986.

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

Bhavikatti, S. S. Structural optimisation using sequential linear programming. New Delhi: Vikas Publishing House Pvt., 2003.

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

Kokosiński, Zbigniew. Układy generatorów obiektów kombinatorycznych dla systemów sekwencyjnych i równoległych. Kraków: Politechnika Krakowska im. Tadeusza Kościuszki, 1993.

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

KEK), Gijutsu Kōryūkai (1998. Gijutsu Kōryūkai hōkokushū: Proceedings of the Meeting on the Technical Study at KEK : KEK, Tsukuba, Japan, February 12-13, 1998. Tsukuba-shi: High Energy Accelerator Research Organization, 1998.

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

KEK), Gijutsu Kōryūkai (1995. Gijutsu Kōryūkai hōkokushū: Proceedings of the Meeting on the Technical Study at KEK : KEK, Tsukuba, Japan, November 28-29, 1995. Tsukuba-shi: National Laboratory for High Energy Physics, 1996.

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

Kumar, Pradeep. Pattern discovery using sequence data mining: Applications and studies. Hershey, PA: Information Science Reference, 2012.

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

Vajteršic, Marián. Algorithms for Elliptic Problems: Efficient Sequential and Parallel Solvers. Dordrecht: Springer Netherlands, 1993.

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

Ashar, Pranav. Sequential logic synthesis. Boston: Kluwer Academic Publishers, 1992.

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

Conger, Jim. MIDI sequencing in C. Redwood City, Calif: M&T Books, 1989.

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

Bakeman, Roger. Analyzing interaction: Sequential analysis with SDIS and GSEQ. Cambridge: Cambridge University Press, 1995.

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

Części książek na temat "Sequential processing (Computer science)"

1

Weik, Martin H. "sequential processing". W Computer Science and Communications Dictionary, 1551. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_17020.

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

Weik, Martin H. "sequential batch processing". W Computer Science and Communications Dictionary, 1550. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_17006.

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

Weik, Martin H. "sequential-by-key processing". W Computer Science and Communications Dictionary, 1550. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_17008.

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

Kremer, Stefan C., i John F. Kolen. "Dynamical Recurrent Networks for Sequential Data Processing". W Lecture Notes in Computer Science, 107–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10719871_8.

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

Hammerton, James A., i Barry L. Kalman. "Holistic Symbol Processing and the Sequential RAAM: An Evaluation". W Lecture Notes in Computer Science, 298–312. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10719871_21.

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

Koerner, Edgar, i Ursula Koerner. "Concurrent parallel-sequential processing in gamma controlled cortical-type networks of spiking neurones". W Lecture Notes in Computer Science, 91–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0020138.

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

Grigoryev, Vladimir, i Igor Khvorov. "Combined Adaptive Spatial-Temporal Signal Processing System Based on Sequential Circuit with Dependent Component Adaptation". W Lecture Notes in Computer Science, 621–35. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23126-6_56.

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

Khan, Abbas, Omnia Alwazzan, Martin Benning i Greg Slabaugh. "Sequential Segmentation of the Left Atrium and Atrial Scars Using a Multi-scale Weight Sharing Network and Boundary-Based Processing". W Lecture Notes in Computer Science, 69–82. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-31778-1_7.

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

Weik, Martin H. "sequential computer". W Computer Science and Communications Dictionary, 1551. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_17011.

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

Weik, Martin H. "sequential". W Computer Science and Communications Dictionary, 1550. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_17002.

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

Streszczenia konferencji na temat "Sequential processing (Computer science)"

1

Tinetti, Fernando G., Mónica A. Lopez, Pedro G. Cajaraville i Diego L. Rodrigues. "Fortran Legacy Code Performance Optimization: Sequential and Parallel Processing with OpenMP". W 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.90.

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

Xiaowei Qin i Yan Liu. "Matrix-based multidimensional sequential pattern mining algorithm and application". W 2012 International Conference on Computer Science and Information Processing (CSIP). IEEE, 2012. http://dx.doi.org/10.1109/csip.2012.6308994.

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

Aguirre-López, Mario A., Omar Efraín Izaguirre-Prado, Roberto Soto-Villalobos i Filiberto Hueyotl-Zahuantitla. "A novel silhouette extraction method for binary images based on the Wall-Follower algorithm". W Computer Science Research Notes. University of West Bohemia, Czech Republic, 2024. http://dx.doi.org/10.24132/csrn.3401.46.

Pełny tekst źródła
Streszczenie:
Silhouette extraction involves separating objects of interest from their background, which has several applications in image processing. Among the silhouette extraction techniques, contour tracing is commonly applied to images with a uniform background. This paper introduces a novel contribution to contour tracing techniques, utilizing the Wall-Follower Algorithm (WFA) to extract silhouettes with uniform backgrounds, or binary images. The algorithm is based on the analogy of a follower sequentially walking aside the external boundary of a wall, without separating a hand from it; then, the follower walks tagging silhouette pixels along the way until returning to the initial position and direction. Experimentation on vehicle technical drawings, satellite views of bodies of water and photographs of plants shows its effectiveness in producing high-quality silhouettes while showing some advantages over existing techniques. They include quickness in obtaining a solution, efficiency and ability to handle complex contours, and the option to simplify the results by reducing the percentage of saved points that trace the perimeter, based on object characteristics. The robustness of the algorithm suggests it as a promising alternative with diverse applications in image analysis, computer-aided design, and 3D object reconstruction, by extruding silhouettes, the latter being the main motivation for this contribution.
Style APA, Harvard, Vancouver, ISO itp.
4

Badarinath, Rakshith, Kai-Wen Tien i Vittaldas Prabhu. "Unified Control of Production, Capacity, and Pre-Emptive Maintenance of Fused Filament Fabrication Process". W ASME 2018 13th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/msec2018-6641.

Pełny tekst źródła
Streszczenie:
The quest for smarter manufacturing is motivating the need for operational decisions to be made in real-time to adapt to uncertainties. Prevailing decision-making techniques typically consider each manufacturing function in isolation to reduce the complexity, which in turn leads to sequential decision-making where prior decisions become constraints for subsequent decisions. This paper proposes a unified approach for simultaneously controlling the timing of production events, the timing of maintenance events, and physical processing capacity. Moreover, the control algorithms can be fully distributed and exploit physics-based models for processes and remaining-useful-life of machinery components in real-time decision-making. Fused Filament Fabrication (FFF) additive manufacturing process is used as an example in the paper to demonstrate the unified approach. Dynamics of the resulting unified control system is modeled using non-linear discontinuous differential equations. Computer simulations are used to illustrate dynamic interactions between production and maintenance functions. Benchmarking of the unified control approach for randomly generated datasets show superior performance compared to other commonly used scheduling heuristics by about 48%.
Style APA, Harvard, Vancouver, ISO itp.
5

Azar, Yossi, Uriel Felge, Michal Feldman i Moshe Tennenholtz. "Sequential decision making with vector outcomes". W ITCS'14: Innovations in Theoretical Computer Science. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2554797.2554817.

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

Fried, Dror, Axel Legay, Joël Ouaknine i Moshe Y. Vardi. "Sequential Relational Decomposition". W LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3209108.3209203.

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

Hsu, William, Jim Warren i Patricia Riddle. "Multivariate Sequential Analytics for Treatment Trajectory Forecasting". W ACSW 2019: Australasian Computer Science Week 2019. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3290688.3290724.

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

Blum, Avrim, Jamie Morgenstern, Ankit Sharma i Adam Smith. "Privacy-Preserving Public Information for Sequential Games". W ITCS'15: Innovations in Theoretical Computer Science. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2688073.2688100.

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

Chen, Weiru, Shanshan Chen i Yang Zhang. "Structural Relation Sequential Patterns Mining". W 2009 International Conference on Research Challenges in Computer Science (ICRCCS). IEEE, 2009. http://dx.doi.org/10.1109/icrccs.2009.75.

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

Gradwohl, Ronen, Noam Livne i Alon Rosen. "Sequential Rationality in Cryptographic Protocols". W 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2010. http://dx.doi.org/10.1109/focs.2010.65.

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

Raporty organizacyjne na temat "Sequential processing (Computer science)"

1

Modlo, Yevhenii O., Serhiy O. Semerikov, Pavlo P. Nechypurenko, Stanislav L. Bondarevskyi, Olena M. Bondarevska i Stanislav T. Tolmachev. The use of mobile Internet devices in the formation of ICT component of bachelors in electromechanics competency in modeling of technical objects. [б. в.], wrzesień 2019. http://dx.doi.org/10.31812/123456789/3264.

Pełny tekst źródła
Streszczenie:
Computer simulation of technical objects and processes is one of the components of the system of professional training of a modern electromechanics engineer. It has been established that despite the fact that mobile Internet devices (MID) are actively used by electrical engineers, the methods of using them in the process of bachelor in electromechanics training is considered only in some domestic scientific studies. The article highlights the components of the methods of using MID in the formation of the ICT component of the competence of the bachelor in electromechanics in modeling of technical objects, providing for students to acquire basic knowledge in the field of Computer Science and modern ICT and skills to use programming systems, math packages, subroutine libraries, and the like. For processing tabular data, it is proposed to use various freely distributed tools that do not significantly differ in functionality, such as Google Sheets, Microsoft Excel, for processing text data – QuickEdit Text Editor, Google Docs, Microsoft Word. For 3D-modeling and viewing the design and technological documentation, the proposed comprehensive use of Autodesk tools in the training process.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Sequential processing (Computer science)” 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