Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

33 articles for “ε-Constraint Method”
Set a search alert
Also matching:2 special issues
Research ArticleOpen accessIn the abstractTwo Simple Yet Effective Strategies for Avoiding Over-Smoothing in SFS ProblemMonica Carfagni, Rocco Furferi, Lapo Governi et al.Minimization techniques are widely used for retrieving a 3D surface starting from a single shaded image i.e., for solving the shape from shading problem. Such techniques are based on the assumption that expected surface to be retrieved coincides with the one that minimize a properly developed functional, consisting of several contributions. Among the possible contributes defining the functional, the so … …Journal of Computer Science, Vol. 12, Issue 3 · 20 Apr 2016 · 8,122 accessesView PDFCite
Research ArticleOpen accessIn the abstractModeling of Multi-Level Capacitated Lot-Size Scheduling ProblemZuhaimy Ismail, Diyana Abd Mahad, Tan Siew ChingProblem statement: Lot-size is the clustering of items for transportation or manufacturing processes occurring at the same time. The issue in lot-size problem is to design production processes so that the feasible production quantities are equal to customer demand quantities and the timing of production is such that inventory positions are almost zero. Approach: In this study, we explore the … …American Journal of Applied Sciences, Vol. 8, Issue 3 · 25 Mar 2011 · 7,319 accessesView PDFCite
Research ArticleOpen accessIn the abstractTwo Reformulations for the Dynamic Quadratic Assignment ProblemSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both … …Journal of Mathematics and Statistics, Vol. 6, Issue 4 · 31 Dec 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDFCite
Research ArticleOpen accessIn the abstractGait Optimization of Biped Robot during Double Support Phase by Pure Dynamic SynthesisNima Jamshidi, Mostafa RostamiThis paper deals with dynamic optimization of biped locomotion. The main focus of this research is motion optimization of double support phase. The optimization problem is dealt by using Pontryagins Maximum Principal. For motion optimization of double support phase, the closed kinematic chain has been considered to be opened at appropriate joint and the components of ground reaction forces has … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 7,127 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn the Discretized Algorithm for Optimal Problems Constrained by Differential Equation with Real CoefficientsO. OlotuA discretized scheme, Discretized Continuous Algorithm (DCA), for solving constrained quadratic optimal control problems was developed to ease the computational cumbersomeness inherent in some existing algorithms, particularly, the Function Space A lgorithm (FSA) by replacing the integral by a series of summation. In order to accomplish this numerical scheme, we resort to a finite approximation of it by discretizing its … …Journal of Mathematics and Statistics, Vol. 3, Issue 4 · 31 Dec 2007 · 6,851 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Iterative Method for Algorithms Implementation on a Limited Dynamically Reconfigurable HardwareAbdellatif Mtibaa, Abdessalem B. Abdelali, Lotfi Boussaid, Elbey BourennaneIn this study we propose a framework and a combined temporal partitioning and design space exploration method for run time reconfigurable processors. Our objective is to help designers to implement an algorithm in limited FPGA area resources while respecting the execution time constraint. The algorithm to be implemented is represented by a task graph with different implementation alternatives (design points) … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,536 accessesView PDFCite
Research ArticleOpen accessIn the abstractConstraints Optimization for Minimizing Stretch in Bounded-ParameterizationAnuwat Dechvijankit, Hiroshi Nagahashi, Kota AokiIn a mesh parameterization process that generates one-to-one mapping information between a three-dimensional surface and a two-dimensional plane, we need to set some constraint positions in the solving system to define a specific location or size of the mapping plane. In this study, we will discuss how to perform a bounded-parameterization that minimizes distortion based on changing of constraints setting … …Journal of Computer Science, Vol. 12, Issue 9 · 26 Nov 2016 · 7,074 accessesView PDFCite
Research ArticleOpen accessIn the abstractFACE RECOGNITION USING RELATIONSHIP LEARNING BASED SUPER RESOLUTION ALGORITHMSenthilSingh, ManikandanThe face recognition is an application which is for identifying a person from a digital image. The common problem that often occurs while identifying the face from image is due to the low resolution in images especially when it is captured from a long distance. In automated face recognition system, this has always been a challeging problem. To overcome this … …American Journal of Applied Sciences, Vol. 11, Issue 3 · 16 Jan 2014 · 6,968 accessesView PDFCite
Research ArticleOpen accessIn the abstractParticle Swarm Optimization-Based Routing Protocol for Clustered Heterogeneous Sensor Networks with Mobile SinkR. Sudarmani, K.R. Shankar KumarIn Wireless Sensor Networks (WSN) sensor nodes with sensing, computing and communication infrastructure are randomly deployed and organized as clusters. Most of the existing sensor networks focus on homogeneous in which the cluster heads are changed periodically. To improve the lifetime of energy constraint battery powered WSN and to avoid energy sink-hole problem; Clustered Heterogeneous Sensor Networks (HSN) are analyzed … …American Journal of Applied Sciences, Vol. 10, Issue 3 · 18 Mar 2013 · 6,840 accessesView PDFCite