11328 search results - page 19 / 2266 » Timed Branching Processes |
105
Voted
INFORMS
2006
15 years 1 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
155
click to vote
SMR
2010
15 years 7 days ago
2010
Usually, for a particular business process different variants exist. Each of them constitutes an adjustment of a reference process model to specific requirements building the proc...
106
click to vote
BPM
2008
Springer
15 years 3 months ago
2008
Springer
For a particular business process, typically, different variants exist. Each of them constitutes an adjustment of a basic process (e.g. a reference process) to specific requirement...
138
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo...
119
Voted
ADC
2008
Springer
15 years 3 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...