Sciweavers

3670 search results - page 366 / 734
» Linear Recursive Functions
Sort
View
PE
1998
Springer
158views Optimization» more  PE 1998»
15 years 6 months ago
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
Charles Knessl, Charles Tier
TCAD
1998
125views more  TCAD 1998»
15 years 6 months ago
BDD-based synthesis of extended burst-mode controllers
Abstract—We examine the implications of a new hazard-free combinational logic synthesis method [1], which generates multiplexor-based networks from binary decision diagrams (BDDs...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
ACTA
2008
88views more  ACTA 2008»
15 years 5 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
JCT
2010
117views more  JCT 2010»
15 years 5 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
JITECH
2010
116views more  JITECH 2010»
15 years 5 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen