Zaloguj się

Gotowe bibliografie tematyczne / Coded Computation

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Coded Computation”

Autor: Grafiati

Data publikacji: 6 września 2023

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 „Coded Computation”.

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 "Coded Computation"

1

Kim, Minchul, i Jungwoo Lee. "Private Secure Coded Computation". IEEE Communications Letters 23, nr 11 (listopad 2019): 1918–21. http://dx.doi.org/10.1109/lcomm.2019.2934436.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Kosaian, Jack, K. V. Rashmi i Shivaram Venkataraman. "Learning-Based Coded Computation". IEEE Journal on Selected Areas in Information Theory 1, nr 1 (maj 2020): 227–36. http://dx.doi.org/10.1109/jsait.2020.2983165.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Jia, Zhuqing, i Syed Ali Jafar. "Cross Subspace Alignment Codes for Coded Distributed Batch Computation". IEEE Transactions on Information Theory 67, nr 5 (maj 2021): 2821–46. http://dx.doi.org/10.1109/tit.2021.3064827.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Reisizadeh, Amirhossein, Saurav Prakash, Ramtin Pedarsani i Amir Salman Avestimehr. "Coded Computation Over Heterogeneous Clusters". IEEE Transactions on Information Theory 65, nr 7 (lipiec 2019): 4227–42. http://dx.doi.org/10.1109/tit.2019.2904055.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Chen, Li, Kaifeng Han, Ying Du i Zhiqin Wang. "Block-Division-Based Wireless Coded Computation". IEEE Wireless Communications Letters 11, nr 2 (luty 2022): 283–87. http://dx.doi.org/10.1109/lwc.2021.3125983.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Ozfatura, Emre, Sennur Ulukus i Deniz Gündüz. "Straggler-Aware Distributed Learning: Communication–Computation Latency Trade-Off". Entropy 22, nr 5 (13.05.2020): 544. http://dx.doi.org/10.3390/e22050544.

Pełny tekst źródła

Streszczenie:

When gradient descent (GD) is scaled to many parallel workers for large-scale machine learning applications, its per-iteration computation time is limited by straggling workers. Straggling workers can be tolerated by assigning redundant computations and/or coding across data and computations, but in most existing schemes, each non-straggling worker transmits one message per iteration to the parameter server (PS) after completing all its computations. Imposing such a limitation results in two drawbacks: over-computation due to inaccurate prediction of the straggling behavior, and under-utilization due to discarding partial computations carried out by stragglers. To overcome these drawbacks, we consider multi-message communication (MMC) by allowing multiple computations to be conveyed from each worker per iteration, and propose novel straggler avoidance techniques for both coded computation and coded communication with MMC. We analyze how the proposed designs can be employed efficiently to seek a balance between the computation and communication latency. Furthermore, we identify the advantages and disadvantages of these designs in different settings through extensive simulations, both model-based and real implementation on Amazon EC2 servers, and demonstrate that proposed schemes with MMC can help improve upon existing straggler avoidance schemes.

Style APA, Harvard, Vancouver, ISO itp.

7

Obead, Sarah A., Hsuan-Yin Lin, Eirik Rosnes i Jorg Kliewer. "Private Linear Computation for Noncolluding Coded Databases". IEEE Journal on Selected Areas in Communications 40, nr 3 (marzec 2022): 847–61. http://dx.doi.org/10.1109/jsac.2022.3142362.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Hong, Sangwoo, Heecheol Yang i Jungwoo Lee. "Squeezed Polynomial Codes: Communication-Efficient Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication". IEEE Access 8 (2020): 190516–28. http://dx.doi.org/10.1109/access.2020.3031590.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Moritaka, Kiyoshi, i Tomonori Kawano. "Use of Colored Reflectors for Negation or Highlighting of Scanned Color Information on Film-Based CIELAB-Coded Optical Logic Gate Models". Journal of Advanced Computational Intelligence and Intelligent Informatics 17, nr 6 (20.11.2013): 799–804. http://dx.doi.org/10.20965/jaciii.2013.p0799.

Pełny tekst źródła

Streszczenie:

In the last two decades, a number of researchers have been engaged in the study of natural computing systems that employ physical, chemical, and biological properties as direct media for manifesting computations. Among such attempts, studies focusing on the use of lights as key computation components in particular have attracted the attention of researchers and engineers, since these studies are potentially applicable to signal processing through optical interconnections between electronic devices. Our research team has recently been engaged in the study of a novel color-based natural computing model. Our recent works included using CIELAB-coded colors on printed-paper to compute Boolean conjunctions (AND operations). In this study, we performed Boolean operations based on CIELAB-coded colors by placing color-printed films over aluminum-coated reflectors with and/or without color. The results of the operations were gathered by testing the color codes printed on the films for negation or highlighting. This type of CIELAB-based color computing has a wide range of potential applications, such as a method for security or access control to secured systems. Such applications could match paired color keys on which the arrays of color codes could be printed and optically computed.

Style APA, Harvard, Vancouver, ISO itp.

10

Akbari-Nodehi, Hanzaleh, i Mohammad Ali Maddah-Ali. "Secure Coded Multi-Party Computation for Massive Matrix Operations". IEEE Transactions on Information Theory 67, nr 4 (kwiecień 2021): 2379–98. http://dx.doi.org/10.1109/tit.2021.3050853.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Coded Computation"

1

Wang, Sinong. "Coded Computation for Speeding up Distributed Machine Learning". The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555336880521062.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Chen, Yiqi. "Computation of Initial State for Tail-Biting Trellis". Ohio University / OhioLINK, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1125026574.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Chan, Siu Yan. "Efficient computation of weight enumerators and performance bounds for convolutionally coded systems in quasi-static fading channels /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20CHANS.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Veluri, Subrahmanya Pavan Kumar. "Code Verification and Numerical Accuracy Assessment for Finite Volume CFD Codes". Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/28715.

Pełny tekst źródła

Streszczenie:

A detailed code verification study of an unstructured finite volume Computational Fluid Dynamics (CFD) code is performed. The Method of Manufactured Solutions is used to generate exact solutions for the Euler and Navier-Stokes equations to verify the correctness of the code through order of accuracy testing. The verification testing is performed on different mesh types which include triangular and quadrilateral elements in 2D and tetrahedral, prismatic, and hexahedral elements in 3D. The requirements of systematic mesh refinement are discussed, particularly in regards to unstructured meshes. Different code options verified include the baseline steady state governing equations, transport models, turbulence models, boundary conditions and unsteady flows. Coding mistakes, algorithm inconsistencies, and mesh quality sensitivities uncovered during the code verification are presented. In recent years, there has been significant work on the development of algorithms for the compressible Navier-Stokes equations on unstructured grids. One of the challenging tasks during the development of these algorithms is the formulation of consistent and accurate diffusion operators. The robustness and accuracy of diffusion operators depends on mesh quality. A survey of diffusion operators for compressible CFD solvers is conducted to understand different formulation procedures for diffusion fluxes. A patch-wise version of the Method of Manufactured Solutions is used to test the accuracy of selected diffusion operators. This testing of diffusion operators is limited to cell-centered finite volume methods which are formally second order accurate. These diffusion operators are tested and compared on different 2D mesh topologies to study the effect of mesh quality (stretching, aspect ratio, skewness, and curvature) on their numerical accuracy. Quantities examined include the numerical approximation errors and order of accuracy associated with face gradient reconstruction. From the analysis, defects in some of the numerical formulations are identified along with some robust and accurate diffusion operators.
Ph. D.

Style APA, Harvard, Vancouver, ISO itp.

5

Ben, Hadj Fredj Abir. "Computations for the multiple access in wireless networks". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLT030.

Pełny tekst źródła

Streszczenie:

Les futures générations de réseaux sans fil posent beaucoup de défis pour la communauté de recherche. Notamment, ces réseaux doivent être en mesure de répondre, avec une certaine qualité de service, aux demandes d'un nombre important de personnes et d'objets connectés. Ce qui se traduit par des exigences assez importantes en termes de capacité. C'est dans ce cadre que les méthodes d'accès multiple non orthogonaux (NOMA) ont été introduit. Dans cette thèse, nous avons étudié et proposé une méthodes d'accès multiple basé sur la technique compute and forawrd et sur les réseaux de point (Lattice codes) tout en considérant différentes constructions de lattice. Nous avons également proposé des amélioration de l'algorithme de décodage de la méthode SCMA (Sparse code multiple access) basé sur les réseaux de points. Afin de simplifier les décodeurs multi-niveaux utilisés, nous avons proposé des expressions simplifiées de LLRs ainsi que des approximations. Finalement, nous avons étudié la construction D des lattices en utilisant les codes polaires. Cette thèse était en collaboration avec le centre de recherche de Huawei France
Future generations of wireless networks pose many challenges for the research community. In particular, these networks must be able to respond, with a certain quality of service, to the demands of a large number of connected people and objects. This drives us into quite important requirements in terms of capacity. It is within this framework that non-orthogonal multiple access methods (NOMA) have been introduced. In this thesis, we have studied and proposed a multiple access method based on the compute and forward technique and on Lattice codes while considering different lattice constructions. We have also proposed improvements to the algorithm for decoding the Sparse code multiple access (SCMA) method based on Lattice codes. In order to simplify the multi-stage decoders used in here, we have proposed simplified expressions of LLRs as well as approximations. Finally, we studied the construction D of lattices using polar codes. This thesis was in collaboration with the research center of Huawei France

Style APA, Harvard, Vancouver, ISO itp.

6

Zeng, Fanxuan. "Nonlinear codes: representation, constructions, minimum distance computation and decoding". Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284241.

Pełny tekst źródła

Streszczenie:

Resum La teoria de codis estudia el disseny de codis correctors d'errors per a la transmisió fidedigne d'informació per un canal amb soroll. Un codi corrector d'errors (o simplement codi) es un proces que consisteix en expressar una seqüència d'elements sobre un alfabet de tal manera que qualsevol error que sigui introduït pot ser detactat i corregit (amb limitacions), i està basat en la tècnica d'afegir elements redundants. Aquest proces inclou la codifcació, la transmisió i la descodifcació de la seqüència d'elements. La majoria dels codis utilitzat són codis bloc i la majoria d'ells tenen una estructura lineal, que facilita el procés de codifcació i descodifcació. En aquesta memòria, estudiarem codis correctors d'errors no lineals. Mal¬grat els codis no lineals no tenen les mateixes bones propietats per codifcar i descodifcar com els lineals, el codis no lineals tenen interes ates que alguns dels millors codis no son lineals. La primera qüestió que apareix quan s'utilitzen codis no lineals és la seva representació. Els codis lineals poden ser representats utilitzant una matriu generadora o una matriu de control. La millor manera de representar un codi no lineal és utilitzar la representacio kernel/caset, que permet represen¬tar un codi mitjanCoding theory deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. An error-correcting code (or code) is a process, which consists on expressing a sequence of elements over an alphabet in such a way that any introduced error can be detected and corrected (with limitation), and it is based on adding redundancy elements. This process includes encoding, transmitting and decoding the sequence of elements. Most of the used codes are block codes and most of them have a linear structure, which facilitates the process of encoding and decoding. In this dissertation, nonlinear error-correcting codes are studied. Despite non¬linear codes do not have the same good properties for encoding and decoding as linear ones, they have interest because some of best codes are nonlinear. The frst question that arises when we use nonlinear codes is their repre-sentation. Linear codes can be represented by using a generator or parity¬check matrix. The best way to represent a nonlinear code is by using the kernel/coset representation, which allows us to represent it through some representative codewords instead of all codewords. In this dissertation, this representation is studied and efcient algorithms to compute the kernel and coset representatives from the list of codewords are given. In addition, prop¬erties such as equality, inclusion, intersection and union between nonlinear codes are given in terms of this representation. Also, some well known code constructions (extended, punctured,...) are described by manipulating directly the kernel and coset representatives ofthe constituent nonlinearcodes. In order to identify a code (linear or nonlinear), the length n, number of codewords M and minimum distance d are the most important parameters. The length n and size M are comparatively easy to compute. On the other hand, to determine the minimum distance of a code is not so easy. As a matter offact, it has been proven to be an NP-hard problem [37]. However, some algorithms have been developed to compute the minimum distance for linear codes using diferent approaches: Grabner bases [7], tree structure [25], probabilistic algorithms [13, 23] and vector enumeration [39]. For nonlinear codes, except for some special families, no general algorithms have been developed to compute their minimum distance. Using the kernel/coset representation and the Brouwer-Zimmermann's algorithm to compute the minimum dis¬tance for linear codes, new algorithms to compute the minimum distance for nonlinear codes are described. The hardest problem in the process of transmitting information is de¬coding. For linear codes, a general decoding algorithm is the syndrome de¬coding. However, there is not any general decoding method for nonlinear codes. Based on the kernel/coset representation and the minimum distance computation, new general algorithms to decode linear and nonlinear codes are proposed. For some linear codes (codes with a big codimension), the proposed algorithms have better performance than the syndrome decoding algorithm. For nonlinear codes, this is the frst general method for decoding, which is comparable to syndrome decoding for linear ones. Finally, most of these algorithms have been evaluated using the MAGMA software, and a new MAGMA package to deal with binary nonlinear codes has been developed, based in the results given in this dissertation.

Style APA, Harvard, Vancouver, ISO itp.

7

Rodal, Morten. "Scalability of seismic codes on computational clusters". Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9145.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Cusdin, P. A. "Automatic sensitivity code for computational fluid dynamics". Thesis, Queen's University Belfast, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.431586.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Hagen, Knut Imar. "Fault-tolerance for MPI Codes on Computational Clusters". Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8728.

Pełny tekst źródła

Streszczenie:

This thesis focuses on fault-tolerance for MPI codes on computational clusters. When an application runs on a very large cluster with thousands of processors, there is likely that a process crashes due to a hardware or software failure. Fault-tolerance is the ability of a system to respond gracefully to an unexpected hardware or software failure. A test application which is meant to run for several weeks on several nodes is used in this thesis. The application is a seismic MPI application, written in Fortran90. This application was provided by Statoil, who wanted a fault-tolerant implementation. The original test application had no degree of fault-tolerance --if one process or one node crashed, the entire application also crashed. In this thesis, a collection of fault-tolerant techniques are analysed, including checkpointing, MPI Error handlers, extending MPI, replication, fault detection, atomic clocks and multiple simultaneous failures. Several MPI implementations are described, like MPICH1, MPICH2, LAM/MPI and Open MPI. Next, some fault-tolerant products which are developed at other universities are described, like FT-MPI, FEMPI, MPICH-V including its five protocols, the fault-tolerant functionality of Open MPI, and MPI Error handlers. A fault-tolerant simulator which simulates the application's behaviour is developed. The simulator uses two fault-tolerance methods: FT-MPI and MPI Error handlers. Next, our test application is similarly made fault-tolerant with FT-MPI using three proposed approaches: MPI_Reduce(), MPI_Barrier(), and the final and current implementation: MPI Loop. Tests of the MPI Loop implementation are run on a small and a large cluster to verify the fault-tolerant behaviour. The seismic application survives a crash of n-2 nodes/processes. Process number 0 must stay alive since it acts as an I/O server, and there must be at least one process left to compute data. Processes can also be restarted rather than left out, but the test application needs to be modified to support this.

Style APA, Harvard, Vancouver, ISO itp.

10

Bellini, Emanuele. "Computational techniques for nonlinear codes and Boolean functions". Doctoral thesis, Università degli studi di Trento, 2014. https://hdl.handle.net/11572/369066.

Pełny tekst źródła

Streszczenie:

We present some upper bounds on the size of nonlinear codes and their restriction to systematic codes and linear codes. These bounds, which are an improvement of a bound by Zinoviev, Litsyn and Laihonen, are independent of other classical known theoretical bounds. Among these, we mention the Griesmer bound for linear codes, of which we provide a partial generalization for the systematic case. Our experiments show that in some cases (the majority of cases for some q) our bounds provide the best value, compared to all other closed-formula upper-bounds. We also present an algebraic method for computing the minimum weight of any nonlinear code. We show that for some particular code, using a non-standard representation of the code, our method is faster than brute force. An application of this method allows to compute the nonlinearity of a Boolean function, improving existing algebraic methods and reaching the same complexity of algorithms based on the fast Fourier transform.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Coded Computation"

1

Fujii, Keisuke. Quantum Computation with Topological Codes. Singapore: Springer Singapore, 2015. http://dx.doi.org/10.1007/978-981-287-996-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Albuquerque, Clarice Dias de, Eduardo Brandani da Silva i Waldir Silva Soares. Quantum Codes for Topological Quantum Computation. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06833-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Block error-correcting codes: A computational primer. Berlin: Springer, 2003.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Parthasarathy, K. R. Lectures on quantum computation, quantum error: Correcting codes and information theory. New Delhi: Published for the Tata Institute of Fundamental Research [by] Narosa Pub. House, 2006.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Matters computational: Ideas, algorithms, source code. Heidelberg: Springer, 2011.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Wigton, L. B. GMRES acceleration of computational fluid dynamics codes. New York: AIAA, 1985.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

XambØ-Descamps, S. Block error-correcting codes: A computational primer. Berlin: Springer, 2002.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Justesen, Jorn. A course in error-correcting codes. Zurich: European Mathematical Society, 2004.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Lin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Lin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Coded Computation"

1

Barendregt, Henk. "Discriminating Coded Lambda Terms". W Logic, Meaning and Computation, 275–85. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-0526-5_12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Korejo, Imtiaz, Shengxiang Yang i Changhe Li. "A Directed Mutation Operator for Real Coded Genetic Algorithms". W Applications of Evolutionary Computation, 491–500. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12239-2_51.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Drake, Stephen. "Uniform Crossover Revisited: Maximum Disruption in Real-Coded GAs". W Genetic and Evolutionary Computation — GECCO 2003, 1576–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45110-2_32.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Datta, Dilip, i José Rui Figueira. "A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study". W Evolutionary Computation in Combinatorial Optimization, 35–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12139-5_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Tezuka, Masaru, Masaharu Munetomo i Kiyoshi Akama. "Linkage Identification by Nonlinearity Check for Real-Coded Genetic Algorithms". W Genetic and Evolutionary Computation – GECCO 2004, 222–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24855-2_20.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Bazargani, Mosab, Luís Mateus i Maria Amélia R. Loja. "Planar Surfaces Recognition in 3D Point Cloud Using a Real-Coded Multistage Genetic Algorithm". W Applications of Evolutionary Computation, 529–40. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16549-3_43.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Giacobini, Mario, Mike Preuss i Marco Tomassini. "Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA". W Evolutionary Computation in Combinatorial Optimization, 86–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11730095_8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Park, Sung-Joon, i Masayuki Yamamura. "Real-Coded Genetic Algorithm to Reveal Biological Significant Sites of Remotely Homologous Proteins". W Genetic and Evolutionary Computation — GECCO 2003, 1602–3. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45110-2_45.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Ahn, Chang Wook, R. S. Ramakrishna i David E. Goldberg. "Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World". W Genetic and Evolutionary Computation – GECCO 2004, 840–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24854-5_86.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Hausmann, Daniel, i Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints". W Tools and Algorithms for the Construction and Analysis of Systems, 38–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.

Pełny tekst źródła

Streszczenie:

AbstractIt is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires $$\mathcal {O}(n^{\frac{k}{2}})$$ O ( n k 2 ) iterations of the function. Calude et al.’s recent quasipolynomial-time parity game solving algorithm essentially shows how to compute the same fixpoint in only quasipolynomially many iterations by reducing parity games to quasipolynomially sized safety games. Universal graphs have been used to modularize this transformation of parity games to equivalent safety games that are obtained by combining the original game with a universal graph. We show that this approach naturally generalizes to the computation of solutions of systems of any fixpoint equations over finite lattices; hence, the solution of fixpoint equation systems can be computed by quasipolynomially many iterations of the equations. We present applications to modal fixpoint logics and games beyond relational semantics. For instance, the model checking problems for the energy $$\mu $$ μ -calculus, finite latticed $$\mu $$ μ -calculi, and the graded and the (two-valued) probabilistic $$\mu $$ μ -calculus – with numbers coded in binary – can be solved via nested fixpoints of functions that differ substantially from the function for parity games but still can be computed in quasipolynomial time; our result hence implies that model checking for these $$\mu $$ μ -calculi is in $$\textsc {QP}$$ QP . Moreover, we improve the exponent in known exponential bounds on satisfiability checking.

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Coded Computation"

1

Yosibash, Royee, i Ram Zamir. "Frame Codes For Distributed Coded Computation". W 2021 11th International Symposium on Topics in Coding (ISTC). IEEE, 2021. http://dx.doi.org/10.1109/istc49272.2021.9594259.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Ferdinand, Nuwan, i Stark C. Draper. "Hierarchical Coded Computation". W 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437473.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Kim, Minchul, i Jungwoo Lee. "Private Secure Coded Computation". W 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849252.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Das, Anindya B., Li Tang i Aditya Ramamoorthy. "C3LES: Codes for Coded Computation that Leverage Stragglers". W 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613321.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Rachlin, Eric, i John E. Savage. "A framework for coded computation". W 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595409.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Reisizadeh, Amirhossein, Saurav Prakash, Ramtin Pedarsani i Salman Avestimehr. "Coded computation over heterogeneous clusters". W 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006961.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Lee, Kangwook, Ramtin Pedarsani, Dimitris Papailiopoulos i Kannan Ramchandran. "Coded computation for multicore setups". W 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006962.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Kim, Wilton, Stanislav Kruglik i Han Mao Kiah. "Coded Computation of Multiple Functions". W 2023 IEEE Information Theory Workshop (ITW). IEEE, 2023. http://dx.doi.org/10.1109/itw55543.2023.10161651.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Kiani, Shahrzad, Nuwan Ferdinand i Stark C. Draper. "Exploitation of Stragglers in Coded Computation". W 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437871.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Sun, Yuxuan, Junlin Zhao, Sheng Zhou i Deniz Gunduz. "Heterogeneous Coded Computation across Heterogeneous Workers". W GLOBECOM 2019 - 2019 IEEE Global Communications Conference. IEEE, 2019. http://dx.doi.org/10.1109/globecom38437.2019.9014006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Coded Computation"

1

Gleich, David, i Ananth Grama. Current possibilities and future opportunities for erasure coded computations. Office of Scientific and Technical Information (OSTI), grudzień 2020. http://dx.doi.org/10.2172/1734624.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Grebennikov, A. N., A. K. Zhitnik i O. A. Zvenigorodskaya. Results of comparative RBMK neutron computation using VNIIEF codes (cell computation, 3D statics, 3D kinetics). Final report. Office of Scientific and Technical Information (OSTI), grudzień 1995. http://dx.doi.org/10.2172/219464.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Batra, Romesh C. Computations for Truck Sliding with TRUCK 3.1 Code. Fort Belvoir, VA: Defense Technical Information Center, sierpień 1989. http://dx.doi.org/10.21236/ada212270.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Aeschliman, D. P., i W. L. Oberkampf. Experimental methodology for computational fluid dynamics code validation. Office of Scientific and Technical Information (OSTI), wrzesień 1997. http://dx.doi.org/10.2172/563720.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Haehnel, Robert, Yonghu Wenren i Luke Allen. SAGE-PEDD theory manual : modeling windblown snow deposition around buildings. Engineer Research and Development Center (U.S.), sierpień 2022. http://dx.doi.org/10.21079/11681/44942.

Pełny tekst źródła

Streszczenie:

Numerical modeling of snowdrifting is a useful tool for assessing the impact of building design on operations and facility maintenance. Here we outline the theory for the SAGE-PEDD snowdrift model that has application for determining snowdrift accumulation around buildings. This model uses the SAGE computational fluid dynamics code to determine the flow field in the computational domain. A particle entrainment, dispersion, and deposition (PEDD) model is coupled to SAGE to simulate the movement and deposition of the snow within the computational domain. The report also outlines areas of future development that upgrades to the SAGE-PEDD model should address.

Style APA, Harvard, Vancouver, ISO itp.

6

Van Buren, Kendra L., Jesse M. Canfield, Francois M. Hemez i Jeremy A. Sauer. Code Verification of the HIGRAD Computational Fluid Dynamics Solver. Office of Scientific and Technical Information (OSTI), maj 2012. http://dx.doi.org/10.2172/1040022.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Oberkampf, W. L., i F. G. Blottner. Issues in computational fluid dynamics code verification and validation. Office of Scientific and Technical Information (OSTI), wrzesień 1997. http://dx.doi.org/10.2172/544047.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

DeGiorgi, Virginia G., i Stephanie A. Wimmer. Evaluation of Computational Codes for Underwater Hull Analysis Model Applications. Fort Belvoir, VA: Defense Technical Information Center, luty 2014. http://dx.doi.org/10.21236/ada594756.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Christon, M. A. HYDRA, A finite element computational fluid dynamics code: User manual. Office of Scientific and Technical Information (OSTI), czerwiec 1995. http://dx.doi.org/10.2172/109508.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Nichols, B. D., C. Mueller, G. A. Necker, J. R. Travis, J. W. Spore, K. L. Lam, P. Royl, R. Redlinger i T. L. Wilson. GASFLOW: A Computational Fluid Dynamics Code for Gases, Aerosols, and Combustion, Volume 1: Theory and Computational Model. Office of Scientific and Technical Information (OSTI), październik 1998. http://dx.doi.org/10.2172/1218.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!