1,721,558 research outputs found
S. F. Mason, Histoire des Sciences
No full textDelorme S. S. F. Mason, Histoire des Sciences. In: Revue d'histoire des sciences et de leurs applications, tome 9, n°2, 1956. pp. 177-178
S. F. Mason, Histoire des Sciences
No full textDelorme S. S. F. Mason, Histoire des Sciences. In: Revue d'histoire des sciences et de leurs applications, tome 9, n°2, 1956. pp. 177-178
S. F. Mason, Histoire des Sciences
No full textTaton René. S. F. Mason, Histoire des Sciences. In: Annales. Economies, sociétés, civilisations. 15ᵉ année, N. 1, 1960. pp. 185-187
K-eccentricity and absolute k-centrum of a probabilistic Tree
No full textThe k-eccentricity evaluated at a point x of a graph G is the sum of the (weighted) distances from x to the k vertices farthest from it. The k-centrum is the set of vertices for which the k-eccentricity is a minimum. The concept of k-centrum includes, as a particular case, that of center and that of centroid (or median) of a graph. The absolute k-centrum is the set of points (not necessarily vertices) for which the k-eccentricity is a minimum. In this paper it will be proven that, for a weighted tree, both deterministic and probabilistic, the k-eccentricity is a convex function and that the absolute k-centrum is a connected set and is contained in an elementary path. Hints will be given for the construction of an algorithm to find the k-centrum and the absolute k-centrum
A NOTE ON A PERFECT FORWARD PROCEDURE FOR A SINGLE FACILITY DYNAMIC LOCATION RELOCATION PROBLEM
No full textIn a recent paper, M. Bastian and M. Volkmer (Oper. Res. Lett. 12, 11–16) [1] proposed a perfect forward algorithm for the solution of a single facility dynamic location/relocation problem. Here, we first provide a numerical example to demonstrate that this problem does not always have a finite forecast horizon. Secondly, we restate the original problem in terms of a shortest path problem in an acyclic network and give an obvious condition (which is both necessary and sufficient) for the existence of a finite forecast horizon for obtaining an optimal initial decision. Then a simple perfect forward algorithm for obtaining an optimal initial decision (when a finite forecast horizon exists) is presented. This algorithm can be considered as a version of Dijkstra's algorithm. It is our opinion that the formulation proposed here is substantially simpler than the one presented in [1] and helps a bit more to understand the real nature of the problem
Review of recent results about the k-centrum of a Tree
No full textThis paper is concerned with thekappa-centrum of a graph. This concept, related to a particular location problem, generalizes that of the center and that of the median of a graph: thekappa-centrum is the set of points for which the sum of the (weighted) distances from thekappa farthest vertices is minimized. The paper will review some recent results about this problem. In particular, some properties of cardinality, connectivity and, more generally, of the structure of thekappa-centrum of a weighted tree will be presented
S. F. Mason. Main Currents of Scientific Thought. A History of the Sciences
No full textHooykaas R. S. F. Mason. Main Currents of Scientific Thought. A History of the Sciences . In: Revue d'histoire des sciences et de leurs applications, tome 8, n°2, 1955. pp. 178-180
S. F. Mason, Histoire des Sciences. Traduit de l'anglais par Marguerite Vergnaud
No full textDopp Joseph. S. F. Mason, Histoire des Sciences. Traduit de l'anglais par Marguerite Vergnaud. In: Revue Philosophique de Louvain. Troisième série, tome 54, n°41, 1956. pp. 166-167
S. F. Mason. Main Currents of Scientific Thought. A History of the Sciences
No full textHooykaas R. S. F. Mason. Main Currents of Scientific Thought. A History of the Sciences . In: Revue d'histoire des sciences et de leurs applications, tome 8, n°2, 1955. pp. 178-180
- …
