6943 search results - page 499 / 1389 » Representations for evolutionary algorithms |
273
Voted
AB
2008
Springer
15 years 9 months ago
2008
Springer
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
207
click to vote
APN
2008
Springer
15 years 9 months ago
2008
Springer
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
188
click to vote
CAV
2008
Springer
15 years 9 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
189
click to vote
RSS
2007
15 years 8 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
206
Voted
VMV
2008
15 years 8 months ago
2008
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling ...