Sciweavers

1310 search results - page 136 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
ESIAT
2009
IEEE
14 years 7 months ago
Study on Architecture of Photogrammetric Parallel Processing System Based on Cluster Computing
Comparing with the rapidly increasing acquiring technology for remotely sensed data, the data processing technologies have been following behind, especially in computing speed and ...
Liu Hangye, Sui Xuelian, Zong Jingchun
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 1 months ago
On evolving buffer overflow attacks using genetic programming
In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better de...
Hilmi Günes Kayacik, Malcolm I. Heywood, A. N...
WSC
2007
15 years 8 days ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
AIPS
1994
14 years 11 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
AAAI
2010
14 years 11 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko