نتایج جستجو برای: frontier algorithm

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

2001
Indriyati Atmosukarto Luping Zhou Wee Kheng Leow Zhiyong Huang

3D digitization devices produce very large sets of 3D points sampled from the surfaces of the objects being scanned. A mesh construction procedure needs to be applied to derive polygon mesh from the 3D point sets. As the 3D points derived from digitization devices based on digital imaging technologies are inherently non-uniformly distributed over regions that may contain surface discontinuities...

Abstract Predictive analytics is an area of statistics that deals with extracting information from data and using it to predict trends and behavior patterns. Many mathematical modeling has been developed and used for prediction, and in some cases, they have been found to be very strong and reliable. This paper studies different mathematical and statistical approaches for events prediction. The ...

Journal: :international journal of agricultural management and development 2013
shahram saeedian mahmoud sabouhi sabouni javad shahraki ebrahim moradi mohammad sepahi

this paper uses the concept of meta-frontier to investigate the relationship between meta technology ratios (mtr) and different varieties in datepalms including; mazafati, rabi and zardan that are produced widely in sistan and baluchestan province of iran. we used a stratified sampling of 300 date farmers of this province in 2010, 2011 and 2012 and estimated a stochastic production frontier usi...

2001
Hussein A. Abbass Ruhul Sarker

The use of evolutionary algorithms (EAs) to solve problems with multiple objectives (known as Multi-objective Optimization Problems (MOPs)) has attracted much attention recently. Being population based approaches, EAs offer a means to find a group of pareto-optimal solutions in a single run. Differential Evolution (DE) is an EA that was developed to handle optimization problems over continuous ...

2009
K. P. ANAGNOSTOPOULOS G. MAMANIS

We propose a computational procedure to find the efficient frontier for the standard Markowitz mean-variance model with discrete variables. The integer constraints limit on the one hand the portfolio to contain a predetermined number of assets and, on the other hand, the proportion of the portfolio held in a given asset. We adapt the multiobjective algorithm NSGA for solving the problem. The al...

Journal: :IEEE robotics and automation letters 2021

In this paper we propose a planner for 3D exploration that is suitable applications using state-of-the-art sensors such as lidars, which produce large point clouds with each scan. The based on the detection of frontier - boundary between explored and unknown part environment consists algorithm detecting points, followed by clustering points selecting best to be explored. Compared existing front...

Journal: :The Computer Science Journal of Moldova 2011
Elmehdi Aitnouri Mohammed Ouali

In this paper, we tackle the performance evaluation of two clustering algorithms: EFC and AIC-based. Both algorithms face the cluster validation problem, in which they need to estimate the number of components. While EFC algorithm is a direct method, the AIC-based is a verificative one. For a fair quantitative evaluation, comparisons are conducted on numerical data and image histograms data are...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

The problem of utilizing undesirable (bad) outputs in DEA models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. The Kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. Also, there are some specific features of non-radial data envelopment analysis (DEA...

2015
Tarek Emam

This paper addresses the problem of capturing nondominated points on convex Pareto frontiers, which are encountered in invex multi-objective programming problems. An algorithm to find a piecewise linear approximation of the nondominated set of convex Pareto frontier are applied. Index Term-Approximation, Nondominated points, Invex multi-objective problems, Block norms.

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

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