272 search results - page 47 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
CRV
2007
IEEE
13 years 11 months ago
2007
IEEE
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
ASPDAC
2000
ACM
13 years 11 months ago
2000
ACM
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
ARCS
2006
Springer
13 years 11 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
BMCBI
2008
13 years 7 months ago
2008
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
AAAI
1998
13 years 8 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...