Sciweavers

7015 search results - page 239 / 1403
» Approximation algorithms for co-clustering
Sort
View
DCOSS
2010
Springer
15 years 9 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
KBS
2008
98views more  KBS 2008»
15 years 5 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu
ICGA
2006
312views Optimization» more  ICGA 2006»
17 years 6 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
CEC
2003
IEEE
15 years 12 months ago
Comparing neural networks and Kriging for fitness approximation in evolutionary optimization
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
Lars Willmes, Thomas Bäck, Yaochu Jin, Bernha...
ISPEC
2010
Springer
15 years 11 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson