2880 search results - page 78 / 576 » Approximate Range Searching |
125
click to vote
IPCO
2010
15 years 1 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
109
click to vote
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
130
click to vote
ALGOSENSORS
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
154
click to vote
HEURISTICS
1998
15 years 2 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
119
click to vote
NICSO
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...