129 search results - page 11 / 26 » Optimal solutions for moving target search |
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we report on a study in which genetic algorithms are applied to the analysis of noisy time-series signals, which is related to the problem of analyzing the motion ch...
121
click to vote
ATAL
2011
Springer
13 years 11 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
111
click to vote
ASIAN
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...