Results 331 to 340 of about 42,049,725 (376)
Some of the next articles are maybe not open access.
1978
The types of variable in Pascal programs have been classified (in chapter 7) as unstructured and structured. The structured types have been further subdivided into elementary structured types and advanced structured types. The variables themselves may also be divided into two groups, depending on the manner of their creation.
A. M. Addyman, I. R. Wilson
openaire +2 more sources
The types of variable in Pascal programs have been classified (in chapter 7) as unstructured and structured. The structured types have been further subdivided into elementary structured types and advanced structured types. The variables themselves may also be divided into two groups, depending on the manner of their creation.
A. M. Addyman, I. R. Wilson
openaire +2 more sources
Biochimie, 1982
260 sequences of tRNA are compared, after their classification into six categories: prokaryotic (83 sequences) and eukaryotic (83 sequences) elongators, prokaryotic (10 sequences) and eukaryotic (11 sequences), initiators, lower eukaryotic mitochondrial tRNA (53 sequences) and archaebacterial tRNA (20 sequences).
Grosjean, Henri +2 more
openaire +3 more sources
260 sequences of tRNA are compared, after their classification into six categories: prokaryotic (83 sequences) and eukaryotic (83 sequences) elongators, prokaryotic (10 sequences) and eukaryotic (11 sequences), initiators, lower eukaryotic mitochondrial tRNA (53 sequences) and archaebacterial tRNA (20 sequences).
Grosjean, Henri +2 more
openaire +3 more sources
1982
So far, we have given each variable an individual name. This is impractical, if many variables are necessary that are treated in the same way and are of the same type, such as, for example, if a table of data is to be constructed. In this case, we wish to give the entire set of data a name and to denote individual elements with an identifying number, a
openaire +2 more sources
So far, we have given each variable an individual name. This is impractical, if many variables are necessary that are treated in the same way and are of the same type, such as, for example, if a table of data is to be constructed. In this case, we wish to give the entire set of data a name and to denote individual elements with an identifying number, a
openaire +2 more sources
On the dynamization of data structures
BIT, 1988We present a simple dynamization method that preserves the query and storage costs of a static data structure and ensures reasonable update costs. In this method, the majority of data elements are maintained in a single data structure, and the updates are handled using ``smaller'' auxiliary data structures.
Rao, Nageswara S. V. +2 more
openaire +2 more sources
Software: Practice and Experience, 1981
AbstractWhile the control structures in recent programming languages are structured, the data structures are still primitive. This paper examines data structures and operations on them, and proposes some new features in programming languages. These new features are principally in the areas of data description and data usage.
I. R. Wilson, Nazim H. Madhavji
openaire +3 more sources
AbstractWhile the control structures in recent programming languages are structured, the data structures are still primitive. This paper examines data structures and operations on them, and proposes some new features in programming languages. These new features are principally in the areas of data description and data usage.
I. R. Wilson, Nazim H. Madhavji
openaire +3 more sources
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness! This includes lower bounds for: (a) high-dimensional problems, where the goal is to show large space lower bounds; (b) constant-dimensional geometric problems, where the ...
openaire +2 more sources
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness! This includes lower bounds for: (a) high-dimensional problems, where the goal is to show large space lower bounds; (b) constant-dimensional geometric problems, where the ...
openaire +2 more sources
Data Structures, Program Structures
2018At the beginning of July 1975 I left Rome with my wife and my three children, respectively 4 years, 2 years and 8 months old. Destination Ithaca. The house had been lent to us by a colleague of the Computer Science Department of Cornell University and was on the outskirts of Ithaca, uphill.
openaire +2 more sources
Computer Languages, 1978
The procedural approach to data structures used in the SL5 programming language is described. The SL5 procedure mechanism forms the basis for this approach to data structures by treating procedures and their activation records (environments) as data objects and by decomposing the traditionally atomic operation of procedure invocation into more ...
openaire +3 more sources
The procedural approach to data structures used in the SL5 programming language is described. The SL5 procedure mechanism forms the basis for this approach to data structures by treating procedures and their activation records (environments) as data objects and by decomposing the traditionally atomic operation of procedure invocation into more ...
openaire +3 more sources
Acta Mathematica Scientia, 1983
Abstract It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence, and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.
openaire +3 more sources
Abstract It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence, and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.
openaire +3 more sources
2017
In the next sections, we will cover the database model employed by force.com, how to configure security for your data, how to generate data without code, and how to query that data using the Developer Console. In order to perform the queries, we will also cover force.com’s query languages. Grab a good cup of coffee or tea as this chapter is mostly text,
openaire +2 more sources
In the next sections, we will cover the database model employed by force.com, how to configure security for your data, how to generate data without code, and how to query that data using the Developer Console. In order to perform the queries, we will also cover force.com’s query languages. Grab a good cup of coffee or tea as this chapter is mostly text,
openaire +2 more sources