19 search results - page 2 / 4 » On the Tree Width of Ada Programs |
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
ICGA
1993
13 years 6 months ago
1993
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
ICCAD
2001
IEEE
14 years 1 months ago
2001
IEEE
This paper hierarchically constructs a hybrid mesh/tree clock network structure consisting of overlying zero-skew clock meshes, with underlying zero-skew clock trees originating f...