2266 search results - page 364 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
206
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
183
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
209
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
156
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
158
click to vote
COR
2008
15 years 6 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...