Cost-sensitive learning extends classical machine learning by considering various types of costs, such as test costs and misclassification costs, of the data. In many applications, there is a test cost constraint due to limited money, time, or other resources. It is necessary to deliberately choose a set of tests to preserve more useful information for classification. To cope with this issue, w...

Traditionally, path selection within routing is formulated as a shortest optimization problem. The objective function for could be any one variety of parameters such number hops, delay, cost...etc. problem least cost delay constraint studied in this paper since very common requirement many multimedia applications and minimization captures the need todistribute network. So an iterative algorithm...

Foot-mounted pedestrian navigation system (PNS) is a common solution to using micro-electro mechanical (MEMS) inertial sensors. The inherent problems of (INS) by the traditional algorithm, such as accumulated errors and lack observation heading altitude information, have become obstacles application development PNS. In this paper, we introduce heuristic constraint method. First all, according m...

We study the minimum spanning tree problem on complete graph $K_n$ where an edge $e$ has a weight $W_e$ and cost $C_e$, each of which is independent copy random variable $U^\gamma$ $\gamma\leq 1$ $U$ uniform $[0,1]$ variable. There also constraint that $T$ must satisfy $C(T)\leq c_0$. establish, for range values $c_0,\gamma$, asymptotic value optimum via consideration dual problem.

It is always a very costly process to achieve a high level of reliability in software industry. So it is desirable for an industry to design software with minimum cost and optimal level of reliability. This paper addresses the problem of maximizing reliability of software by minimizing the overall cost of software. The technique deals with selecting various modules of application with optimal r...