3894 search results - page 672 / 779 » Approximation Algorithms for Biclustering Problems |
125
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
118
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Design optimization is a well established application field of evolutionary computation. However, standard recombination operators acting on the genotypic representation of the d...
144
click to vote
SSD
2005
Springer
15 years 8 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
113
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
122
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...