173 search results - page 25 / 35 » An optimal randomized algorithm for maximum Tukey depth |
IAT
2009
IEEE
14 years 2 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....
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
JSAC
2008
13 years 7 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
QRE
2008
13 years 7 months ago
2008
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
SIAMIS
2010
13 years 2 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...