594 search results - page 53 / 119 » Travelling Miser Problem |
AINA
2010
IEEE
14 years 29 days ago
2010
IEEE
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
FCS
2006
13 years 9 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
ROBOCUP
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, the problem of determining if a population of mobile robots is able to travel from an initial con guration to a target con guration is addressed. This problem is rel...
ALGORITHMICA
1998
13 years 7 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...