140 search results - page 9 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
CEC
2008
IEEE
13 years 10 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
DAC
1999
ACM
14 years 28 days ago
1999
ACM
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In medical research, being able to justify decisions is generally as important as taking the right ones. Interpretability is then one of the chief characteristics a learning algor...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are distributed among a number of clust...
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...