Results 271 to 280 of about 113,652 (316)

Testing block subdivision algorithms on block designs

Journal of Geographical Systems, 2015
Integrated land use–transportation models predict future transportation demand taking into account how households and firms arrange themselves partly as a function of the transportation system. Recent integrated models require parcels as inputs and produce household and employment predictions at the parcel scale.
Natalie Wiseman, Zachary Patterson
openaire   +1 more source

Proving that non-blocking algorithms don't block

ACM SIGPLAN Notices, 2009
A concurrent data-structure implementation is considered non-blocking if it meets one of three following liveness criteria: wait-freedom, lock-freedom, or obstruction-freedom. Developers of non-blocking algorithms aim to meet these criteria. However, to date their proofs for non-trivial algorithms have been only manual pencil-and-paper semi-formal ...
Alexey Gotsman, Byron Cook, Matthew Parkinson, Viktor Vafeiadis   +3 more
openaire   +1 more source

Block‐iterative algorithms

International Transactions in Operational Research, 2009
AbstractThe recently presented sequential unconstrained minimization algorithm, SUMMA, is extended to provide a framework for the derivation of block‐iterative, or partial‐gradient, optimization methods. This block‐iterative SUMMA (BI‐SUMMA) includes, and is motivated by, block‐iterative versions of the algebraic reconstruction technique (ART) and its ...
openaire   +1 more source

The Block-P3M algorithm

Computer Physics Communications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

VLSI Architectures For Block Matching Algorithms

SPIE Proceedings, 1988
Architectures for the realization of block matching algorithms are discussed, with emphasis on highly concurrent systolic array processors. A mapping methodology for systolic arrays known from the literature is applied to block matching algorithms. Examples of two-dimensional and one-dimensional systolic arrays are presented.
T. Komarek, P. Pirsch
openaire   +1 more source

“Balancing” the Block Davidson–Liu Algorithm

Journal of Chemical Theory and Computation, 2016
We describe a simple modification ("balancing") of the block Davidson-Liu eigenvalue algorithm which allows the norms of the Krylov search directions to decrease naturally as convergence is approached. In the context of integral-direct configuration interaction singles and time-dependent density functional theory, this provides for efficient ...
Robert M, Parrish, Edward G, Hohenstein, Todd J, Martínez   +2 more
openaire   +2 more sources

Block Matching Algorithm based on RANSAC Algorithm

2010 International Conference on Image Analysis and Signal Processing, 2010
A new type of real-time image stabilization system is introduced in present paper. RANSAC Algorithm is used in the system. The accuracy and speed of image stabilization is improved effectively. A low-cost and high-performance solution of real-time digital image stabilization system is given in this paper.
null Kexiang Liu, null Jie Qian, null Ruike Yang   +2 more
openaire   +1 more source

Convergence Analysis of the Block Householder Block Diagonalization Algorithm

BIT Numerical Mathematics, 2005
The authors develop algebraic and convergence properties of the left and right block reflectors used in block diagonalization algorithms. For this purpose, block Householder transformations are used. More precisely, the convergence of the algorithm is shown under a weak condition.
Robbé, M., Sadkane, M.
openaire   +1 more source

Block Algorithms for Orthogonal Symplectic Factorizations

BIT Numerical Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Two Block Partitioned Dijkstra Algorithms

2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013
The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to ...
Xinyu Mao, Yuxin Cheng, Haige Xiang
openaire   +1 more source