75 search results - page 11 / 15 » A Multilevel Approach to the Travelling Salesman Problem |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
FLAIRS
2006
14 years 11 months ago
2006
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
121
click to vote
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
JMLR
2006
14 years 9 months ago
2006
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
121
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...