Sciweavers

156 search results - page 22 / 32
» Another Complete Local Search Method for SAT
Sort
View
EMO
2001
Springer
107views Optimization» more  EMO 2001»
13 years 12 months ago
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
Joshua D. Knowles, Richard A. Watson, David Corne
IROS
2009
IEEE
170views Robotics» more  IROS 2009»
14 years 2 months ago
Optimal trajectory design for parametric excitation walking
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
Yoshihisa Banno, Yuji Harata, Kouichi Taji, Yoji U...
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 5 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
IJFCS
2006
110views more  IJFCS 2006»
13 years 7 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang