840 search results - page 110 / 168 » Inapproximability of Combinatorial Optimization Problems |
131
Voted
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
154
click to vote
IPCO
2010
15 years 1 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
110
Voted
AIR
2004
15 years 8 days ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
SDM
2010
SIAM
14 years 10 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
79
Voted
IWANN
2001
Springer
15 years 4 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...