We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...
Kai Yang, Yihong Wu, Jianwei Huang, Xiaodong Wang,...
A new approach based on Estimation Distribution Algorithms for constrained multiobjective shape optimization is proposed in this article. Pareto dominance and feasibility rules ar...
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
Event-driven distributed infrastructures are becoming increasingly important for information dissemination and application integration. We examine the problem of optimal resource ...