11328 search results - page 26 / 2266 » Timed Branching Processes |
IFIP
1993
Springer
15 years 8 months ago
1993
Springer
An advanced Self-Timed Reduced Instruction Set Computer (ST-RISC) architecture is described. It is designed hierarchically, and is formally specified functionally at the various ...
103
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
We present an approach to decomposing branching volume data into sub-branches. First, a metric is proposed for evaluating local convexities in volumetric data, and it is a criteri...
101
click to vote
CPC
2006
15 years 4 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
109
click to vote
COR
2007
15 years 4 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
153
click to vote
COLOGNETWENTE
2009
15 years 5 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...