In this paper, we investigate the integrated network planning for telecommunications system, which considers adaptive sectorization and a hybrid F/CDMA scheme jointly under quality of service (QoS) constraints. The problem is formulated as a combinatorial optimization formulation in terms of minimizing the cost. We also investigate the viability of using Lagrangean relaxation (LR) to solve the ...

Emerging market demonstrates four constraints, namely wealth-related constraint, skill-related constraint, access-related constraint and time-related constraint. The distinguishing features of emerging market customers are their low per capita income, consequently, they expect to pay below average price on commercial products with good-enough quality and services. High-quality low-price commodi...

The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generalized arc consistency (GAC) on this constraint that amortizes the cost of the GAC computation over a rootto-terminal path in the search tree. The technique used is an extension of the GAC algorithm for the regular langua...

A design constraint traceable to the early days of spacebome Synthetic Apema'e Radar (SAR) is known as the minimum antenna area constraint for SAR. In this paper, it is confirmed that this constraint strictly applies only to the case where both the best possible resolution and the widest possible swath are the design goals. SAR antennas with area smaller than the constraint allows are shown to ...

We present a new framework of the data-reusing (DR) adaptive algorithms by incorporating a constraint on noise, referred to as a noise constraint. The motivation behind this work is that the use of the statistical knowledge of the channel noise can contribute toward improving the convergence performance of an adaptive filter in identifying a noisy linear finite impulse response (FIR) channel. B...

One of the most important policies adopted in inventory control is the replenishment cycle policy. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a constraint programming approach able to compute optimal replenishment cycle policy parameters under non-stationary stochastic demand, ordering, holding and short...

In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where the goal is to determine a set of nodes in the network to cache/store the given data item, such that the overall communication cost incurred in accessing the item is minimized, under the constraint that the total communi...

We describe a costand constraint-based decision-theoretic approach to the design of screening trials, where the goal is to identify promising candidates for future study. An algorithmic method for optimizing this approach is presented. This method utilizes a highly flexible structure to reflect a variety of decision and experimental costs and constraints. The designs produced can range from bei...

Santos Jr, E., A linear constraint satisfaction approach to cost-based abduction, Artificial Intelligence 65 (1994) 1-27. Abduction is the problem of finding the best explanation for a given set of observations. Within AI, this has been modeled as proving the observation by assuming some set of hypotheses. Cost-based abduction associates a cost with each hypothesis. The best proof is the one wh...