— In this paper, we illustrate the use of a reference point based many-objective particle swarm optimization algorithm to optimize low-speed airfoil aerodynamic designs. Our fram...
Upali K. Wickramasinghe, Robert Carrese, Xiaodong ...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
We address the problem of distributed source coding, i.e. compression of correlated sources that are not co-located and/or cannot communicatewith each other to minimize their join...
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...