3604 search results - page 156 / 721 » All Common Subsequences |
129
click to vote
ICARIS
2005
Springer
15 years 10 months ago
2005
Springer
Many bio-inspired algorithms (evolutionary algorithms, artificial immune systems, particle swarm optimisation, ant colony optimisation, …) are based on populations of agents. Ste...
125
click to vote
ISW
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
136
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
126
click to vote
FMCAD
2004
Springer
15 years 9 months ago
2004
Springer
Late changes in silicon design (ECO) is a common although undesired practice. The need for ECO exists even in high-level design flows since bugs may occur in the specifications, ...
153
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...