Sciweavers

248 search results - page 11 / 50
» The Multi-Story Space Assignment Problem
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 7 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
CVPR
2012
IEEE
12 years 7 days ago
A game-theoretic approach to deformable shape matching
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
Emanuele Rodolà, Alexander M. Bronstein, An...
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
14 years 2 months ago
Sequentially updated Probability Collectives
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
Michalis Smyrnakis, David S. Leslie
CEC
2009
IEEE
14 years 2 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
STACS
2001
Springer
14 years 2 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...