1040 search results - page 145 / 208 » Rounding algorithms for covering problems |
148
click to vote
ACIIDS
2009
IEEE
15 years 2 months ago
2009
IEEE
In this study, we propose a method of stability analysis for a GA-Based reference ANNC capable of handling these types of problems for a nonlinear system. The initial values of the...
147
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
163
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
153
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
142
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...