Results 261 to 270 of about 2,364,233 (300)
Some of the next articles are maybe not open access.
2005
A computational model, based on and/or subgoaling, is described. It is shown that various models of computation, such as recursive program schemes, decision trees and combinational networks, are naturally embedded in the and/or language. These observations pose some interesting questions for further research.
openaire +2 more sources
A computational model, based on and/or subgoaling, is described. It is shown that various models of computation, such as recursive program schemes, decision trees and combinational networks, are naturally embedded in the and/or language. These observations pose some interesting questions for further research.
openaire +2 more sources
Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '83, 1983
In this paper, a new clustering algorithm has been described. The algorithm proposed determines both the number of clusters in a collection, and the number of elements in each cluster before beginning the final clustering process. The complexity assessment of the algorithm and the implementation issues are also emphasized.
Fazli Can, Esen A. Ozkarahan
openaire +2 more sources
In this paper, a new clustering algorithm has been described. The algorithm proposed determines both the number of clusters in a collection, and the number of elements in each cluster before beginning the final clustering process. The complexity assessment of the algorithm and the implementation issues are also emphasized.
Fazli Can, Esen A. Ozkarahan
openaire +2 more sources
Canadian Journal of Mathematics, 2005
AbstractPetrie polygons, especially as they arise in the study of regular polytopes and Coxeter groups, have been studied by geometers and group theorists since the early part of the twentieth century. An open question is the determination of which polyhedra possess Petrie polygons that are simple closed curves.
openaire +2 more sources
AbstractPetrie polygons, especially as they arise in the study of regular polytopes and Coxeter groups, have been studied by geometers and group theorists since the early part of the twentieth century. An open question is the determination of which polyhedra possess Petrie polygons that are simple closed curves.
openaire +2 more sources
ACM SIGPLAN Lisp Pointers, 1988
In this edition of Readings in Scheme , there are twelve additions to the bibliography. Although there are also some corrections, I have chosen to include only the additions, rather than a complete re-print of the bibliography. Another complete re-print will take place sometime next summer.
openaire +1 more source
In this edition of Readings in Scheme , there are twelve additions to the bibliography. Although there are also some corrections, I have chosen to include only the additions, rather than a complete re-print of the bibliography. Another complete re-print will take place sometime next summer.
openaire +1 more source
To scheme or not to scheme : comparison of scheme of arrangement acquisitions with takeover bids [PDF]
, 2023 Schemes of arrangement have been available in Australia since Federation and were initially used as a voluntary administration mechanism. However, while schemes have always been available as an acquisition method through an application of judicial discretion, it has only been in the last 15 years that schemes have become widely acknowledged in the ...
openaire +1 more source
Canadian Mathematical Bulletin, 1969
Let an open, quasi-compact subscheme of an affine scheme be called subaffine. This note will centre on an elementary characterization of such schemes in terms of their topology and global sections. Thence one can obtain simplifications and generalizations of some well-known theorems, such as Serre's Criterion [2, Thm. 1].
openaire +1 more source
Let an open, quasi-compact subscheme of an affine scheme be called subaffine. This note will centre on an elementary characterization of such schemes in terms of their topology and global sections. Thence one can obtain simplifications and generalizations of some well-known theorems, such as Serre's Criterion [2, Thm. 1].
openaire +1 more source
Scandinavian Journal of Haematology, 1984
For hemophilia care on an equitable basis all over the world, adequate treatment should comprise to complex of: Sufficient quantities of finished products, starting from 20,000 IU of factor VIII per patient per annum, to ensure a basic standard and comfort of life.
openaire +2 more sources
For hemophilia care on an equitable basis all over the world, adequate treatment should comprise to complex of: Sufficient quantities of finished products, starting from 20,000 IU of factor VIII per patient per annum, to ensure a basic standard and comfort of life.
openaire +2 more sources
Difference schemes or element schemes?
International Journal for Numerical Methods in Engineering, 1979AbstractSeveral examples are presented to illustrate how standard finite differnce schemes for the wave eqation (e.g. Lax–Wendroff, Leafrog, etc.) can be developed from finite element analysis. The development of the diffrence schemes from the element schemes is made possible by using Galerkin's method on both the spacial and temporal dimensions.
openaire +1 more source