1647 search results - page 143 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
170
click to vote
IAT
2009
IEEE
15 years 11 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
140
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
158
Voted
EMO
2003
Springer
15 years 10 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
142
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
175
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...