نتایج جستجو برای: least cost

تعداد نتایج: 755995  

Journal: :Applied sciences 2023

The optimal size of a diversion structure should be carefully studied to ensure economic viability and safety during construction. In practice, determine the structure, design flood frequency is selected as suggested return period presented by standard, which differently. This study proposes methodology for with concrete cofferdam adopting risk analysis reflect more practical hazard dam propose...

Journal: :Journal of Archaeological Science 2022

Traditionally, Least Cost Paths (LCP) are used for exploring mobility across archaeological landscapes. However, LCPs only highlight optimal paths, and implementing maritime is arduous. In this paper, Circuit Theory (CT) analysis to analyse potential mobility. Key the effect of wind patterns, dependent on month direction travel, This applied case study urbanism in Roman Adriatic, it shown that ...

Journal: :Inf. Process. Lett. 1986
Kwang-Moo Choe C. H. Chang

The locally least-cost error repair scheme, originally proposed by Fischer et al. [5,6], is an error repair scheme which allows the construction of a table-driven or algorithmic error repairing parser with the insertion and deletion cost of the terminal symbols given by the compiler designers. The principal idea governing locally least-cost error repair is that an input symbol at an errordetect...

In recent years, developments in unmanned aerial vehicles, lightweight on-board computers, and low-cost thermal imaging sensors offer a new opportunity for wildlife monitoring. In contrast with traditional methods now surveying endangered species to obtain population and location has become more cost-effective and least time-consuming. In this paper, a low-cost UAV-based remote sensing platform...

Journal: :Discrete Optimization 2013
Andreas S. Schulz Nelson A. Uhan

We study the approximation of the least core value and the least core of supermodular cost cooperative games. We provide a framework for approximation based on oracles that approximately determine maximally violated constraints. This framework yields a 3-approximation algorithm for computing the least core value of supermodular cost cooperative games, and a polynomial-time algorithm for computi...

Journal: :Publications de l'Institut Mathematique 2003

Journal: :Inf. Process. Lett. 1991
Davide Crippa

Given a digraph G = (V; E) and a cost function C : E ! IR, which does not imply negative cost cycles, let us denote by G() the graph obtained from G by adding to the cost of each edge the positive constant ; then we want to compute the cost of the least cost path from a given origin r to each node v in the graph G() for diierent choices of 0, without having to run a least cost path algorithm ev...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید