نتایج جستجو برای: lot clustering

تعداد نتایج: 146318  

Journal: :Computers & OR 2003
Yi Xu Bhaba R. Sarker

Article history: Received 1 August 2011 Accepted 28 October 2011 Available online 29 October 2011 Recently, the economic lot scheduling problem (ELSP) with common cycle time and shelf life restrictions has attracted the attention of several researchers. In this paper, a comparative study of solutions given by Xu and Sarker (2003) [Computers & Operations Research 30 (6), 925938] with the results...

Journal: :European Journal of Operational Research 2011
Erik M. M. Winands Ivo J. B. F. Adan Geert-Jan van Houtum

We consider the production of multiple standardized products on a single machine with limited capacity and set-up times under random demands and random production times, i.e., the so-called stochastic economic lot scheduling problem (SELSP). The main task for the production manager in this setting is the construction of a production plan for the machine that minimizes the total costs, i.e., the...

2003
Lynne Marshall

Richard H. Wilson Veterans Administration Medical Center Mountain Home, TN Audibility thresholds for a 1000-Hz sinusoid were measured with a standard clinical (CLIN) procedure and a two-interval, forced-choice (21FC) adaptive procedure bracketing 79% correct. Both used 2and 5-dB step sizes in quiet and in a continuous, broadband noise background. Clinical thresholds were from 2 to 4 dB higher t...

2004
Karin Murthy

The tremendous amount of data produced nowadays in various application domains such as molecular biology or geography can only be fully exploited by efficient and effective data mining tools. One of the primary data mining tasks is clustering, which is the task of partitioning points of a data set into distinct groups (clusters) such that two points from one cluster are similar to each other wh...

Journal: :Neurocomputing 2010
Feng Zhao Licheng Jiao Hanqiang Liu Xinbo Gao Maoguo Gong

Ng–Jordan–Weiss (NJW) method is one of the most widely used spectral clustering algorithms. For a K clustering problem, this method partitions data using the largest K eigenvectors of the normalized affinity matrix derived from the dataset. It has been demonstrated that the spectral relaxation solution of K-way grouping is located on the subspace of the largest K eigenvectors. However, we find ...

Journal: :JVRB 2012
Dennis Jensch Daniel Mohr Gabriel Zachmann

Skin segmentation is a challenging task due to several influences such as, for example, unknown lighting conditions, skin colored background, and camera limitations. A lot of skin segmentation approaches were proposed in the past including adaptive (in the sense of updating the skin color online) and non-adaptive approaches. In this paper, we compare three different skin segmentation approaches...

2014
Lauren Hund

Lot Quality Assurance Sampling (LQAS) surveys have become increasingly popular in global health care applications. Incorporating Bayesian ideas into LQAS survey design, such as using reasonable prior beliefs about the distribution of an indicator, can improve the selection of design parameters and decision rules. In this paper, a joint frequentist and Bayesian framework is proposed for evaluati...

Journal: :IET Communications 2012
Chao Tong Jianwei Niu Guangzhi Qu Xiang Long Xiaopeng Gao

Recently, research on complex network theory and applications draws a lot of attention in both academy and industry. In mobile ad hoc networks (MANETs) area of research, a critical issue is to design the most effective topology for given problems. It is natural and significant to consider complex networks topology when optimising the MANET topology. Current works usually transform MANET or sens...

Journal: :CoRR 2016
Yu Lu Harrison H. Zhou

Clustering is a fundamental problem in statistics and machine learning. Lloyd’s algorithm, proposed in 1957, is still possibly the most widely used clustering algorithm in practice due to its simplicity and empirical performance. However, there has been little theoretical investigation on the statistical and computational guarantees of Lloyd’s algorithm. This paper is an attempt to bridge this ...

Journal: :Computer Science Review 2008
Dieter Mitsche

Roughly speaking, clustering is a data analysis task to group a set of items into different categories so that items within one category are similar and items between different categories are dissimilar, where similar and dissimilar depend on the definition of distance between items. Although known for many decades, recently clustering has gained a lot of importance due to the exponential growt...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید