Sciweavers

652 search results - page 46 / 131
» Optimization problems involving collections of dependent obj...
Sort
View
DAIS
2009
13 years 9 months ago
Foraging for Better Deployment of Replicated Service Components
Abstract. Our work focuses on distributed software services and their requirements in terms of system performance and dependability. We target the problem of finding optimal deploy...
Máté J. Csorba, Hein Meling, Poul E....
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
14 years 3 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 2 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
COR
2006
129views more  COR 2006»
13 years 8 months ago
Game-theoretic analysis of an ancient Chinese horse race problem
This paper analyzes a legendary Chinese horse race problem involving the King of Qi and General Tianji which took place more than 2000 years ago. In this problem each player owns ...
Mingming Leng, Mahmut Parlar