We propose to merge the two – privacy and cost/utility – usual optimization criteria of Distributed Constraint Optimization Problems (DCOPs) into a unique criterion. Typically, a DCOP requests agents to agree on a tuple of assignments of values to variables such that the sum of costs defined by a set of secret weighted constraints is minimized. However, the privacy requirements on constraints i...

Constraint databases provide a very expressive framework for spatiotemporal database applications. However, animating such databases is diicult because of the cost of constructing a graphical representation of a single snapshot of a constraint database. We present a novel approach that makes the eecient animation of constraint databases possible. The approach is based on a new construct: parame...

Due to the dynamism and heterogeneity of today’s markets, mass customization has been widely applied in the manufacturing industry with the objective of satisfying individual customer needs while maintaining near mass production efficiency. Product family design is an effective approach for mass customization where problem modeling and solution are two significant concerns. As a large amount of...

Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability Pij ∼ r −α ij , where rij is the Manhattan length of the long-range edges. The total length of the additional edges is subject to a cost constraint ( ∑ r = C). These networks have fixed optimal exponent α for...

Constraint Propagation can be speeded up significantly by choosing a good execution order for propagators. A propagator is an implicit representation of a constraint which is widely used in todays powerful constraint solvers. In this paper we evaluate different ways to find good execution orders automatically during runtime. We extend previous work in this area by two new techniques: fair-sched...

We develop asymptotically optimal policies for the multi armed bandit (MAB), problem, under a cost constraint. This model is applicable in situations where each sample (or activation) from a population (bandit) incurs a known bandit dependent cost. Successive samples from each population are iid random variables with unknown distribution. The objective is to have a feasible policy for deciding ...

The paper aims to present a cost evaluation for multi-project environment, taking into account imprecision in activity duration and cost. Data specification in the form of discrete α-cuts enables the connection of distinct and imprecise data, and the implementation of a constraints satisfaction problem with the use of constraint programming. Moreover, using α-cuts, optimistic, pessimistic, and ...

The design of robust time-delay and saturating controllers based on the range of expected variation of uncertain parameters from their nominal values is investigated. A minimax optimization problem is formulated with the objective of minimizing the maximum value of the cost function over the range of the uncertain parameter. By the adoption of the residual energy as the cost function, the optim...

In this paper, we address an optimization problem that arises in 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 communicati...