Sciweavers

1672 search results - page 71 / 335
» Tightness problems in the plane
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
14 years 2 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
AE
2007
Springer
14 years 3 months ago
An Evolutionary Algorithm for the Block Stacking Problem
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
Tim Hohm, Matthias Egli, Samuel Gaehwiler, Stefan ...
COR
2006
140views more  COR 2006»
13 years 9 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
NETWORKS
2010
13 years 7 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...