14518 search results - page 187 / 2904 » Two Problems for Sophistication |
EVOW
2005
Springer
14 years 4 months ago
2005
Springer
We focus on the Golomb ruler problem, a hard constrained combinatorial optimization problem. Two alternative encodings are considered, one based on the direct representation of sol...
STACS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
IPPS
2003
IEEE
14 years 4 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
GECCO
2010
Springer
14 years 3 months ago
2010
Springer
Biogeography-based optimization (BBO) is a new evolutionary algorithm based on the science of biogeography. We propose two extensions to BBO. First, we propose blended migration. ...
AIPS
2008
14 years 1 months ago
2008
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic soluti...