This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated by practically considering the tradeoff among performance, lifetime, and cost when designing sensor n...

A multi-objective linked simulation and optimization (LSO) model for a three dimensional saltwater intrusion problem has been developed. The LSO employs HST3D and Box’s algorithm. The weighting method of multi-objective optimization solves the multi-objective planning problem. The model is capable of determining the optimal pumping rates that minimize the saline concentration at the well sites,...

This paper addresses the LQG control problem for unmanned aerial vehicles (UAV) with time delays. In particular, the case with data-rate limitations is considered. It is shown in our results that the data rate of the communication channel has important effects on the control performances. It is derived that there exists a tradeoff between the data rate and the LQG cost. A quantization, coding, ...

This paper discusses and analyses the tradeoff between the flexibility afforded with greater number of staff and the implied cost of employing extra staff in the context of the nurse-scheduling problem. If the number of staff is constant, our study allows quantification of the degree of pressure put on the staff resulting from the schedules that do not satisfy their preferences for shift alloca...

In this paper we propose and discuss different models to include capacity constraints into the Reliability Fixed-Charge Location Problem. In all cases, the proposed models represent a tradeoff between the extreme models that can be found in the literature, where a priori assignments are either fixed, or can be fully modified at each scenario. In a series of computational experiments we analyze ...

This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...

Substantial work has investigated balancing exploration and exploitation, but relatively little has addressed this tradeoff in the context of coordinated multi-agent interactions. This paper introduces a class of problems in which agents must maximize their on-line reward, a decomposable function dependent on pairs of agent’s decisions. Unlike previous work, agents must both learn the reward fu...

The particle swarm approach provides a low complexity solution to the optimization problem among various existing heuristic algorithms. Recent advances in the algorithm resulted in improved performance at the cost of increased computational complexity, which is undesirable. Literature shows that the particle swarm optimization algorithm based on comprehensive learning provides the best complexi...

In recent years, the surge of large-scale peerto-peer (P2P) applications has brought huge amounts of P2P traffic, which has significantly changed the Internet traffic pattern and increased the traffic-relay cost at the Internet Service Providers (ISPs). To alleviate the stress on networks, methods of localized peer selection have been proposed that advocate neighbor selection within the same ne...

In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364] proved that to sort $n$ elements requires $TS=\Omega(n^2)$ where $T=time$ and $S=space$ on a comparison based branching program. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately fol...