Results 41 to 50 of about 5,818,471 (412)
A Reliable Localization Algorithm Based on Grid Coding and Multi-Layer Perceptron
The traditional RSS-based fingerprint localization algorithm needs RSS values from all access points (AP) at each reference point (RP). In the large-scale indoor environment, the increasing of the number of APs will lead to establish a large-scale ...
Zhengtang Sun, Yang Zhang, Qianqian Ren
doaj +1 more source
Incomparability in parallel computation
AbstractWe consider the relative power of concurrent-write PRAMs when the number of processors (and input variables) is fixed at n, and infinite shared memory is allowed. Several different models (Common, Arbitrary, Priority) have been used for algorithm design in the literature; these models differ in their method of write conflict resolution.
Prabhakar Ragde+2 more
openaire +3 more sources
Parallel Computation of Entries of ${A}^{-1}$ [PDF]
In this paper, we consider the computation in parallel of several entries of the inverseof a large sparse matrix. We assume that the matrix has already been factorized by a direct methodand that the factors are distributed. Entries are efficiently computed by exploiting sparsity of theright-hand sides and the solution vectors in the triangular solution
Amestoy, Patrick+3 more
openaire +7 more sources
Reconfigurable instruction set processors provide the possibility of tailor the instruction set of a CPU to a particular application. While this customization process could be performed during runtime in order to adapt the CPU to the currently executed ...
Mariusz Grad, Christian Plessl
doaj +1 more source
A simplified mesoscale 3D model for characterizing fibrinolysis under flow conditions
One of the routine clinical treatments to eliminate ischemic stroke thrombi is injecting a biochemical product into the patient’s bloodstream, which breaks down the thrombi’s fibrin fibers: intravenous or intravascular thrombolysis.
Remy Petkantchin+6 more
doaj +1 more source
Efficient computation of oriented vertex and arc colorings of special digraphs [PDF]
In this paper we study the oriented vertex and arc coloring problem on edge series-parallel digraphs (esp-digraphs) which are related to the well known series-parallel graphs. Series-parallel graphs are graphs with two distinguished vertices called terminals, formed recursively by parallel and series composition.
arxiv
Parallel computing is a computational technique in which two or more tasks or instructions can be processed concurrently by means of several processors resulting into enhanced computational efficiency as well as decreased time for solving complex ...
Mrs. Anush Sharma
semanticscholar +1 more source
The runjags package provides a set of interface functions to facilitate running Markov chain Monte Carlo models in JAGS from within R. Automated calculation of appropriate convergence and sample length diagnostics, user-friendly access to commonly used ...
M. Denwood
semanticscholar +1 more source
Taskflow: A Lightweight Parallel and Heterogeneous Task Graph Computing System [PDF]
Taskflow aims to streamline the building of parallel and heterogeneous applications using a lightweight task graph-based approach. Taskflow introduces an expressive task graph programming model to assist developers in the implementation of parallel and ...
Tsung-Wei Huang+3 more
semanticscholar +1 more source
Randomized parallel computation [PDF]
The subject of this thesis is randomized parallel algorithms. The goal is to demonstrate the power of randomization in designing efficient parallel algorithms for various computational problems. The specific problems we are concerned with are: sorting, routing, and combinatorial optimization.
Sanguthevar Rajasekaran, John H. Reif
openaire +2 more sources