نتایج جستجو برای: cutting trees
تعداد نتایج: 129549 فیلتر نتایج به سال:
In this study, all the papers about oak decline phenomena in forests of Iran have been reviewed. One hundred and twelve papers from 51 journals were reviewed, and the information presented in each paper was analyzed and finally summarized. Eighty seven percent of the papers were about Brant’s oak (Quercus brantii Lindl.). Most of the studies were focused on the pest and desease of oak decline. ...
Forest management alters species behaviours, distributions and interactions. To evaluate forestry effects on ant foraging performance, we compared the quality and quantity of honeydew harvested by ants among clear-cuts, middle-aged and mature spruce-dominated stands in boreal forests in Sweden. Honeydew quality was examined using honeydew collected by squeezing the gasters of laden Formica aqui...
We study in this paper the problem of jumper insertion on general routing (Steiner/spanning) trees with obstacles for antenna avoidance/fixing at the routing and/or postlayout stages. We formulate the jumper insertion for antenna avoidance/fixing as a tree-cutting problem and present the first optimal algorithm for the general tree-cutting problem. We show that the tree-cutting problem exhibits...
In order to determine the best form factor formula for Loblolly Pine (Pinus taeda L.) plantations in Talesh (Western Guilan province-Iran), a number of 110 trees were selected based on their distribution in diameter classes, from 12 to 34 cm (in a two- cm diameter interval). First, several quantitative factors including diameter at breast height, diameter at 0.65 m of height, and diameter at st...
The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. For many applications of dynamic trees, values must be combined along paths. For other applications, values must be combin...
Nogood learning has proven to be an effective CSP technique critical to success in today’s top SAT solvers. We extend the technique for use in combinatorial optimization problems, as opposed to mere constraint satisfaction. In particular, we examine 0-1 integer programming (0-1 IP). Our technique generates globally valid cutting planes for the 01 IP search algorithm from information learned thr...
Packet classification is one of the fundamental techniques required by various network management functionalities. As the state-of-the-art of software packet classification, decision-tree algorithms employ various geometrical cutting schemes to build optimized decision trees. However, existing cutting schemes cannot meet the desired performance on large rulesets because they sacrifice either cl...
Eucalyptus globulus is an important rapid-growing trees in Eucalypts that applied for agroforestry and tree improvement programs. It has been used as a source of pulp in paper industry, essential oil and honey production. Asexual propagation with conventional methods such as cutting and graft wasnot possible or obtained success was very low, because of hard proliferation of adventitious roots. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید