نتایج جستجو برای: o minimum 1population
تعداد نتایج: 711164 فیلتر نتایج به سال:
In this paper we present an O(n(m + logn))-time algorithm for computing a minimum-weight tree support (if one exists) of a hypergraph H = (V, S) with n vertices and m hyperedges. This improves the previously best known algorithm with running time O(nm). A support of H is a graph G on V such that each hyperedge in S induces a connected subgraph in G. If G is a tree, it is called a tree support a...
The \Minimum Reservation Rate Problem" arises in distributed systems for handling digital audio and video data. The problem is to nd the minimum rate at which data must be reserved on a shared storage system in order to provide continuous buuered playback of a variable-rate output schedule. The problem is equivalent to the minimum output rate: given input rates during various time periods, nd t...
the present paper aims to investigate the role of open metal site metal-organic frameworks (mofs) on hydrogen adsorptivity using periodic boundary condition (pbc) density functional theory (dft). hence, mil-47-m (m = v and fe) were selected and one hydrogen molecule adsorptivity was calculated in different orientations on them. four different chemical sites were identified in every cluster sect...
Given a set P of n points in the plane, we wish to find a set Q ⊂ P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of finding a minimum area convex k-gon, in time O(n log n) and space O(n log n) for fixed k, almost matching known bounds for the minimum area triangle problem. Our algorithm is based on finding a certain number of nearest...
1 Preliminaries 1 1.1 What this is . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Problem statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.3 Big-O and small-o notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.4 Definition: Asymptotic approximation ...
We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with Õ(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtaine...
We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis in weighted partial 2-trees (i.e., graphs of treewidth at most two) with nonnegative edge-weights. The implicit representation can be made explicit in a running time that is proportional to the size of the minimum cycle basis. For planar graphs, Borradaile, Sankowski, and Wulff-Nils...
Medicinal plants are still used traditionally to cure some illnesses. Achillea fragrantissima is among medicinal species used by rural communities in Jordan. The genetic diversity of this species was studied using Random Amplified Polymorphic DNA (RAPD) markers of five populations sampled from five locations in Jordan. Fifteen polymorphic primers were used for the construction of the dendrogram...
Two algorithms for minimum cut linear arrangement of a class of graphs called p-q dags are proposed. A p-q dag represents the connection scheme of an adder tree, such as Wallace tree, and the VLSI layout problem of a bit slice of an adder tree is treated as the minimum cut linear arrangement problem of its corresponding p-q dag. One of the two algorithms is based on dynamic programming. It calc...
BACKGROUND There are concerns regarding early years' training for junior doctors in Trauma & Orthopaedic Surgery (T&O) in the United Kingdom. Our primary objective was to audit the clinical activities undertaken by junior doctors working in Trauma & Orthopaedic (T&O) surgery in the National Health Service (NHS) in a typical workweek. A secondary objective was to audit the clinical exposure of j...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید