Sciweavers

7129 search results - page 257 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICGA
2006
312views Optimization» more  ICGA 2006»
17 years 4 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
129
Voted
CEC
2003
IEEE
15 years 9 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 9 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
ALENEX
2007
158views Algorithms» more  ALENEX 2007»
15 years 5 months ago
Faster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
Juha Kärkkäinen, Joong Chae Na
JCO
2007
149views more  JCO 2007»
15 years 4 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang