In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), which is a generalization of the (RSP). Here objective problem to find subset nodes in network minimize sum routing costs interconnecting cycle assignment are out cycle, their nearest concentrators such that no assigned node exceeds predetermined distance (say, covering distance) from concentrators. The dista...

Park (2010) [8] presented a method to obtain the upper bound on efficiency in imprecise data envelopment analysis (IDEA) in which the envelopment model with imprecise data had been used. In this paper, we consider the dual model, the multiplier model, which involves the non-Archimedean element ε . Then, we define a model to determine the upper bound of ε . An assurance interval for the non-Arch...

§ Elastic Fidelity: exploit the inherent error-tolerance of applications to lower the energy consumption, and withstand the massive errors of future computing. § Allow some data to be imprecise § Programming language constructs and ISA extensions pass the fidelity requirements from application to hardware § Hardware models adjust the voltage to maintain fidelity guarantees § The execution syste...

data envelopment analysis (dea) has been proven as an efficient technique to evaluate the performance of homogeneous decision making units (dmus) where multiple inputs and outputs exist. in the conventional applications of dea, the data are considered as specific numerical values with explicit designation of being an input or output. however, the observed values of the data are sometimes imprec...