328 search results - page 54 / 66 » Algorithms for the edge-width of an embedded graph |
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
Model-based development is becoming an increasingly common development methodology. In important domains like embedded systems already major parts of the code are generated from m...
112
click to vote
ISBRA
2009
Springer
15 years 4 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
WADS
2005
Springer
15 years 2 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
ISSS
1999
IEEE
15 years 1 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...