Sciweavers

2487 search results - page 364 / 498
» Partitions of Graphs into Trees
Sort
View
ADAEUROPE
2008
Springer
14 years 2 months ago
A Framework for CFG-Based Static Program Analysis of Ada Programs
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
Raul Fechete, Georg Kienesberger, Johann Blieberge...
IV
2007
IEEE
164views Visualization» more  IV 2007»
14 years 2 months ago
Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
Pierre-Yves Koenig, Guy Melançon, Charles B...
EUROGP
2005
Springer
122views Optimization» more  EUROGP 2005»
14 years 1 months ago
Evolution of Robot Controller Using Cartesian Genetic Programming
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
Simon Harding, Julian F. Miller
SMA
2003
ACM
14 years 1 months ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 1 months ago
H2 performance of agreement protocol with noise: An edge based approach
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...
Daniel Zelazo, Mehran Mesbahi