28 results for “global search algorithm”

Set a search alert

Research ArticleOpen accessIn the abstractAn Alternative Ray Tracing Algorithm for Understanding Scenes with Embedded ObjectsNancy Dandachy, Dimitri Plemenos, Safwan Chendeb, Bachar El HassanProblem statement: In the virtual world domain, the existing techniques of exploration, were not able alone to resolve the understanding problem of scenes with embedded object, also they are time and memory consuming. As a solution, a novel method that enhances the visualization of 3D ray traced scenes with embedded objects by creating a hole proportional to its interior parts … …Journal of Computer Science, Vol. 6, Issue 6 · 30 Jun 2010 · 7,288 accessesView PDF Cite

Research ArticleOpen accessIn the abstractNew Scaled Sufficient Descent Conjugate Gradient Algorithm for Solving Unconstraint Optimization ProblemsAbbas Y. AL-Bayati, Rafiq S. MuhammadProblem statement: The scaled hybrid Conjugate Gradient (CG) algorithm which usually used for solving non-linear functions was presented and was compared with two standard well-Known NAG routines, yielding a new fast comparable algorithm. Approach: We proposed, a new hybrid technique based on the combination of two well-known scaled (CG) formulas for the quadratic model in unconstrained optimization using exact line … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,046 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Derivative-Free Optimization Method for Solving Classification ProblemParvaneh Shabanzadeh, Malik Abu Hassan, Wah June LeongProblem statement: The aim of data classification is to establish rules for the classification of some observations assuming that we have a database, which includes of at least two classes. There is a training set for each class. Those problems occur in a wide range of human activity. One of the most promising ways to data classification is based on … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,505 accessesView PDF Cite

Research ArticleOpen accessIn the abstractCalculation of Total Cost, Tolerance Based on Taguchi's, Asymmetric Quality Loss Function ApproachR. Sampath Kumar, N. Alagumurthi, R. RameshProblem statement: Current world market force the manufacturing sectors to develop high quality product and process design with minimum possible cost. About 80% of problems in production units may be attributed to 20% of design tolerance causes. While design typically represents the smallest actual cost elements in products (around 5%), it leverages the largest cost influence (around 70%). So design … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 8,045 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSolving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian ProcedureNaif AlajlanProblem statement: To design, implement, and test an algorithm for solving the square jigsaw puzzle problem, which has many applications in image processing, pattern recognition, and computer vision such as restoration of archeological artifacts and image descrambling. Approach: The algorithm used the gray level profiles of border pixels for local matching of the puzzle pieces, which was performed using dynamic … …American Journal of Applied Sciences, Vol. 6, Issue 11 · 30 Nov 2009 · 7,690 accessesView PDF Cite

Research ArticleOpen accessIn the abstractTwo-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained OptimizationAbbas Y. AL-Bayati, A.J. Salim, Khalel K. AbboProblem statement: (CG) algorithms, which we had investigated in this study, were widely used in optimization, especially for large scale optimization problems, because it did not need the storage of any matrix. The purpose of this construction was to find new CG-algorithms suitable for solving large scale optimization problems. Approach: Based on pure conjugacy condition and quadratic convex function two … …American Journal of Economics and Business Administration, Vol. 1, Issue 2 · 30 Jun 2009 · 8,108 accessesView PDF Cite

Research ArticleOpen accessIn the abstractHybridization of Neural Learning Algorithms Using Evolutionary and Discrete Gradient ApproachesRanadhir Ghosh, John Yearwood, Moumita Ghosh, Adil BagirovIn this study we investigated a hybrid model based on the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. Also we discuss different variants for hybrid models using the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. The Discrete Gradient … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,587 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordFINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCHK. Padmapriya, Dr. S. SridharNearest neighbor search is one of the most widely-used techniques and its applications including mobile communication, Geographic information systems, bioinformatics, computer vision and marketing. For example, four friends want to rent an apartment which should be nearer to their working places. Our paper discussed about the problems on finding the most appropriate location among a set of available places. The … …Journal of Computer Science, Vol. 10, Issue 6 · 1 Feb 2014 · 6,803 accessesView PDF Cite