Sciweavers

11328 search results - page 46 / 2266
» Timed Branching Processes
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 1 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 11 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao
BPM
2006
Springer
166views Business» more  BPM 2006»
15 years 5 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
ORL
2007
80views more  ORL 2007»
15 years 1 months ago
Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
For the M/D/1 processor sharing queue, explicit formulas for the coefficient of variation of the sojourn time conditioned on the service time and on the residual service times of ...
Michael Shalmon
IJFCS
2006
106views more  IJFCS 2006»
15 years 1 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...