17760 search results - page 239 / 3552 » A Generalization of the Massey-Ding Algorithm |
152
click to vote
CEC
2005
IEEE
16 years 8 days ago
2005
IEEE
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
168
click to vote
GECCO
2005
Springer
16 years 5 days ago
2005
Springer
The problem of multiple sequence alignment is important for bioinformatics. This problem is widely studied and a popular tool to solve this problem is Clustal X. This work introdu...
153
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
193
click to vote
DIS
2000
Springer
15 years 11 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
149
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...