1091 search results - page 2 / 219 » Approximation Algorithms for Data Placement Problems |
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
JMLR
2008
13 years 5 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
ICCCN
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...