Results 221 to 230 of about 152,093 (265)
Some of the next articles are maybe not open access.
On the Nature of Merge: External Merge, Internal Merge, and Parallel Merge
Linguistic Inquiry, 2005This article argues in favor of a new type of Merge, Parallel Merge, which combines the properties of External Merge and Internal Merge. Parallel Merge creates symmetric, multidominant structures, which become antisymmetric in the course of the derivation.The main empirical goal of the article is to revive a multidominance approach to across-the-board
openaire +1 more source
To Merge or Not to Merge: That Is the Question!
2016The transaction stage of the merger is described including the historical background regarding the University’s decision to merge. Deliberations regarding the strengths and limitations of merging the two departments are presented and analyzed. In these discussions, we highlight the politicking of organizational stakeholders who either supported or ...
Lisa A. Kihl +2 more
openaire +1 more source
Journal of the ACM, 1968
A refinement of the resolution method for mechanical theorem proving is presented. A resolvent C of clauses A and B is called a merge if literals from A and B merge together to form some literal of
openaire +2 more sources
A refinement of the resolution method for mechanical theorem proving is presented. A resolvent C of clauses A and B is called a merge if literals from A and B merge together to form some literal of
openaire +2 more sources
Sublinear merging and natural mergesort
Algorithmica, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Svante Carlsson +2 more
openaire +1 more source
IEEE Transactions on Computers, 1976
Three algorithms are given to construct a weighted r-ary tree with a given set of integer weighted leaves in which the weight of a parent node is 1 + max of its sons. Two goals are of interest; to minimize 1) the weight of the root of the tree, and 2) the number of internal nodes.
openaire +2 more sources
Three algorithms are given to construct a weighted r-ary tree with a given set of integer weighted leaves in which the weight of a parent node is 1 + max of its sons. Two goals are of interest; to minimize 1) the weight of the root of the tree, and 2) the number of internal nodes.
openaire +2 more sources
Robotics and Autonomous Systems, 2005
We illustrate our experience in developing and implementing algorithms for map merging, i.e., the problem of fusing two or more partial maps without common reference frames into one large global map. The partial maps may for example be acquired by multiple robots, or during several runs of a single robot from varying starting positions.
Stefano Carpin +2 more
openaire +1 more source
We illustrate our experience in developing and implementing algorithms for map merging, i.e., the problem of fusing two or more partial maps without common reference frames into one large global map. The partial maps may for example be acquired by multiple robots, or during several runs of a single robot from varying starting positions.
Stefano Carpin +2 more
openaire +1 more source
SIAM Journal on Computing, 1972
This paper studies the merging operation when data is stored on the surfaces of a disk. The data consists of q lists (each of n numbers) stored on a disk. Each list is stored on one surface of a disk. The time needed to merge into a single (sorted) list, T, is a function of the required motion of the reading head.
openaire +1 more source
This paper studies the merging operation when data is stored on the surfaces of a disk. The data consists of q lists (each of n numbers) stored on a disk. Each list is stored on one surface of a disk. The time needed to merge into a single (sorted) list, T, is a function of the required motion of the reading head.
openaire +1 more source
International Journal of Computers and Applications, 2008
Many data sets to be merged consist of (1) n distinct keys and (2) the keys are serial numbers. Merging such data can be represented as merging two sorted arrays A = (a0, a1, ..., an1--1) and B = (b0, b1, ..., bn2--1) of records such that (1) the keys are distinct; (2) 0 ≤ ai · key, bj · key < n, ∀0 ≤ i < n1 and 0 ≤j < n2, where n = n1 + n2 and key is ...
Hazem M. Bahig, Hatem M. Bahig
openaire +1 more source
Many data sets to be merged consist of (1) n distinct keys and (2) the keys are serial numbers. Merging such data can be represented as merging two sorted arrays A = (a0, a1, ..., an1--1) and B = (b0, b1, ..., bn2--1) of records such that (1) the keys are distinct; (2) 0 ≤ ai · key, bj · key < n, ∀0 ≤ i < n1 and 0 ≤j < n2, where n = n1 + n2 and key is ...
Hazem M. Bahig, Hatem M. Bahig
openaire +1 more source
2011
Ziekenhuisorganisaties worden in de komende jaren heringericht. Kantelingen en/of resultaatverantwoordelijke eenheden (RVE’s) zijn hierbij ondergeschikt en vormen maar een beperkt onderdeel van het dienen van de patient.
openaire +1 more source
Ziekenhuisorganisaties worden in de komende jaren heringericht. Kantelingen en/of resultaatverantwoordelijke eenheden (RVE’s) zijn hierbij ondergeschikt en vormen maar een beperkt onderdeel van het dienen van de patient.
openaire +1 more source
Journal of the American College of Radiology, 2017
David, Fessell, Frank J, Lexa
openaire +2 more sources
David, Fessell, Frank J, Lexa
openaire +2 more sources