2P025 Auto-accumulation method using simulated annealing enables fully automatic particle pick up

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Clustering Using Multi-objective Particle Swarm and Simulated Annealing

This paper puts forward a new automatic clustering algorithm based on Multi-Objective Particle Swarm Optimization and Simulated Annealing, "MOPSOSA". The proposed algorithm is capable of automatic clustering which is appropriate for partitioning datasets to a suitable number of clusters. MOPSOSA combines the features of the multi-objective based particle swarm optimization (PSO) and the Multi-O...

متن کامل

Particle Size Distribution Correction Method Using a Simulated Annealing Technique

The procedure for obtaining the particle size distribution by visual inspection of a sample involves stereological errors, given the cut of the sample. A cut particle, supposedly spherical, with radius R, will be counted as a circular particle with radius r, r≤R. The difference between r and R depends on how far from the center of the sphere the cut was performed. This introduces errors when th...

متن کامل

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

متن کامل

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

متن کامل

Automatic Persian text summarizer using simulated annealing and genetic algorithm

Automatic text summarization is a process to reduce the volume of text documents using computer programs to create a text summary with keeping the key terms of the documents. Due to cumulative growth of information and data, automatic text summarization technique needs to be applied in various domains. The approach helps in decreasing the quantity of the document without changing the context of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Seibutsu Butsuri

سال: 2005

ISSN: 0582-4052,1347-4219

DOI: 10.2142/biophys.45.s126_1