8582 search results - page 271 / 1717 » Here or There |
187
click to vote
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
143
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
168
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
168
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
157
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Despite the wide-spread popularity of estimation of distribution algorithms (EDAs), there has been no theoretical proof that there exist optimisation problems where EDAs perform...