2147 search results - page 414 / 430 » Evolutionary Algorithms |
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
100
click to vote
COLT
2008
Springer
15 years 10 days 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...
SODA
2004
ACM
14 years 12 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
BMCBI
2007
14 years 10 months ago
2007
Background: The secondary structure of an RNA must be known before the relationship between its structure and function can be determined. One way to predict the secondary structur...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...