129 search results - page 5 / 26 » Optimal solutions for moving target search |
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
GEM
2010
13 years 6 months ago
2010
Abstract-- The problem of allocating defensive weapon resources to hostile targets is an optimization problem of high military relevance. The need for obtaining the solutions in re...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...