11328 search results - page 55 / 2266 » Timed Branching Processes |
133
click to vote
GRAPHICSINTERFACE
1997
15 years 3 months ago
1997
We present a modelling method and graphical user interface for the creation of natural branching structures such as plants. Structural and geometric information is encapsulated in...
103
click to vote
WSC
1997
15 years 3 months ago
1997
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
100
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
135
click to vote
4OR
2010
15 years 9 days ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
127
click to vote
HIPC
2005
Springer
15 years 7 months ago
2005
Springer
With the increasing programmability of GPUs (graphics processing units), these units are emerging as an attractive computing platform not only for traditional graphics computation ...