论文信息 - The Force Law Design of Artificial Physics Optimization for Starting Population Selection for GSAT

The Force Law Design of Artificial Physics Optimization for Starting Population Selection for GSAT

GSAT is a well-known satisfiability search algorithm which uses some random functions. In this paper, we consider an artificial physics optimization for computing a function of starting population.

Anna Gorbenko | Vladimir Popov

[1] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[2] Anna Gorbenko,et al. Footstep Planning for Humanoid Robots , 2012 .

[3] Anna Gorbenko,et al. Task-resource scheduling problem , 2012, International Journal of Automation and Computing.

[4] Anna Gorbenko,et al. The Problem of Sensor Placement , 2012 .

[5] Anna Gorbenko,et al. Multi-agent Path Planning , 2012 .

[6] Christian Blum,et al. A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem , 2014, EvoCOP.

[7] Anna Gorbenko,et al. Computational Experiments for the Problem of Selection of a Minimal Set of Visual Landmarks , 2012 .

[8] Anna Gorbenko,et al. Programming for Modular Reconfigurable Robots , 2011 .

[9] Andrey Sheka,et al. Localization on Discrete Grid Graphs , 2012 .

[10] Anna Gorbenko,et al. SAT Solvers for the Problem of Sensor Placement , 2012 .

[11] Vladimir Yu. Popov,et al. The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[12] Anna Gorbenko,et al. The problem of placement of visual landmarks , 2011 .

[13] A. Gorbenko,et al. The Longest Common Subsequence Problem , 2012 .

[14] Anna Gorbenko,et al. Clustering algorithm in mobile ad hoc networks , 2012 .

[15] A. Gorbenko,et al. Planning a Typical Working Day for Indoor Service Robots , 2011 .

[16] A. Gorbenko,et al. The longest common parameterized subsequence problem , 2012 .