Sciweavers

545 search results - page 24 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
IRREGULAR
1995
Springer
14 years 22 hour ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
ATAL
2008
Springer
13 years 10 months ago
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
Xiaoming Zheng, Sven Koenig
IPL
2008
78views more  IPL 2008»
13 years 8 months ago
An approximation ratio for biclustering
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
Kai Puolamäki, Sami Hanhijärvi, Gemma C....
ICRA
2008
IEEE
113views Robotics» more  ICRA 2008»
14 years 2 months ago
Reinforcement learning with function approximation for cooperative navigation tasks
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
Francisco S. Melo, M. Isabel Ribeiro
INFOCOM
2009
IEEE
14 years 3 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang