11328 search results - page 10 / 2266 » Timed Branching Processes |
124
click to vote
CPAIOR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
TIME
2007
IEEE
15 years 8 months ago
2007
IEEE
DAGSTUHL
2007
15 years 3 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
116
click to vote
PE
2008
Springer
15 years 1 months ago
2008
Springer
We have proposed a three-parameter renewal approximation to analyze splitting and superposition of autocorrelated processes. We define the index of dispersion for counts of an ord...
CP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...