Sciweavers

4432 search results - page 496 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ANOR
2008
69views more  ANOR 2008»
15 years 4 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
123
Voted
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 10 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
131
Voted
ATAL
2007
Springer
15 years 10 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
CISS
2008
IEEE
15 years 10 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
129
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 9 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...