Results 201 to 210 of about 234,693 (232)
Some of the next articles are maybe not open access.
Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
Operations Research, 1994In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and workload levels are generally approximated by a multidimensional reflected Brownian motion (RBM). Decomposition approximations, on the other hand, typically analyze stations in the network separately, treating each as a single queue with adjusted ...
Dai, J. G. +2 more
openaire +1 more source
An augmenting path method for solving Linear Bottleneck Assignment problems
Computing, 1978An efficient method for solving Linear Bottleneck Assignment problems is described. The method starts with a heuristically determined partial assignment. Then shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed.
Derigs, U., Zimmermann, U.
openaire +1 more source
Determine the Optimal Parameter for Information Bottleneck Method
2006A natural question in Information Bottleneck method is how many "groups" are appropriate. The dependency on prior knowledge restricts the applications of many Information Bottleneck algorithms. In this paper we aim to remove this dependency by formulating the parameter choosing as a model selection problem, and solve it using the minimum message length
Gang Li, Dong Liu, Yangdong Ye, Jia Rong
openaire +1 more source
A Semi-supervised Clustering Method through Bottleneck Distance Exploration
2016 9th International Conference on Service Science (ICSS), 2016Semi-supervised clustering is one of the most active research area in machine learning and pattern recognition, which can improve the performance of unsupervised clustering efficiently. This paper focuses on exploiting both the label information of a few labeled samples and the spatial distribution information of large amount of unlabeled samples.
Yuan Yao +4 more
openaire +1 more source
Unsupervised Image Clustering Using the Information Bottleneck Method
2002A new method for unsupervised image category clustering is presented, based on a continuous version of a recently introduced information theoretic principle, the information bottleneck (IB). The clustering method is based on hierarchical grouping: Utilizing a Gaussian mixture model, each image in a given archive is first represented as a set of ...
Jacob Goldberger +2 more
openaire +1 more source
Phonon Bottleneck Investigation Using a Quantum Statistical Method
physica status solidi (b), 1969AbstractUsing a density‐matrix formalism equations are derived describing the time dependence of spin and phonon temperatures of a paramagnetic crystal with a phonon bottleneck. The derived equations are compared with the usual rate equations describing a phonon bottleneck.
openaire +1 more source
A practical bottleneck detection method
Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304), 2002C. Roser, M. Nakano, M. Tanaka
openaire +1 more source
Finding the Optimal Cardinality Value for Information Bottleneck Method
2006Information Bottleneck method can be used as a dimensionality reduction approach by grouping “similar” features together [1]. In application, a natural question is how many “features groups” will be appropriate. The dependency on prior knowledge restricts the applications of many Information Bottleneck algorithms.
Gang Li +3 more
openaire +1 more source
A new method for bottleneck detection
2008 Winter Simulation Conference, 2008Sankar Sengupta +2 more
openaire +1 more source
Systematic evaluation for bottleneck detection methods
International Journal of Industrial and Systems Engineering, 2017Brian Huff, Mohammed AlMansouri
openaire +1 more source