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

292 results for “Constraint”

Set a search alert
Research ArticleOpen accessIn the keywordsCattle Raising Practices in North-West CambodiaSophany Morm, Koemseang Nhuong, Vibol Peuo et al.We aimed to assess current cattle farming practices in northwest Cambodia in terms of economy, practical management, productivity, and sustainability. The study sites were selected in four provinces (Pursat, Battambang, Pailin, and Banteay Meanchey) with 316 cattle livestock farmers interviewed as representative samples using systematic sampling. A stratified sampling method was utilized. Data were analyzed and descriptive statistics was used … …American Journal of Animal and Veterinary Sciences, Vol. 19, Issue 4 · 7 Dec 2024 · 6,320 accessesView PDFCite
Research ArticleOpen accessIn the keywordsExploring Learning Capability of an Agent in SOAR: Using 8-Queens ProblemNeha Rajan, Sunderrajan SrinivasanCognitive architecture deals with describing the intelligent behavior of an agent. The description of intelligent behavior states how well an agent can solve and represent variety of problems of the domain-independent task. The intelligence of an agent is considered in terms of its learning capabilities. In this study, we are exploring solving 8-Queens combinatorial problem using SOAR symbolic cognitive architecture. … …Journal of Computer Science, Vol. 16, Issue 5 · 25 May 2020 · 7,067 accessesView PDFCite
Research ArticleOpen accessIn the keywordsTwo 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 keywordsOptimal Pareto Solutions of a Dynamic C Chart: An Application of Statistical Process Control on a Semiconductor Devices Manufacturing ProcessToni Lupo, Filippo SgroiThe present paper proposes a novel economic-statistical design procedure of a dynamic c control chart for the Statistical Process Control (SPC) of the manufacturing process of semiconductor devices. Particularly, a non-linear constrained mathematical programming model is formulated and solved by means of the ϵ-constraint method. A numerical application is developed in order to describe the Pareto frontier, that is the … …American Journal of Applied Sciences, Vol. 12, Issue 4 · 28 May 2015 · 6,473 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCOMPARISON USING PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM FOR TIMETABLE SCHEDULINGDennise AdriantoLecturer timetable scheduling is an important part in the resource allocation planning. Due to the large amount of transactions and various related constraints have to be taken into account in timetable scheduling process, resource manager team shall need a lot of time to the solve the problem. This research is aimed to discuss the application of Particle Swarm Optimization (PSO) … …Journal of Computer Science, Vol. 10, Issue 2 · 20 Nov 2013 · 7,027 accessesView PDFCite
Research ArticleOpen accessIn the keywordsTwo 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 keywordsOn 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 keywordsThe Constrained Bottleneck Transportation ProblemPeerayuth Charnsethikul, Saeree SvetasreniTwo classes of the bottleneck transportation problem with an additional budget constraint are introduced. An exact approach was proposed to solve both problem classes with proofs of correctness and complexity. Moreover, the approach was extended to solve a class of multi-commodity transportation network with a special case of the multi-period constrained bottleneck assignment problem. …Journal of Mathematics and Statistics, Vol. 3, Issue 1 · 31 Mar 2007 · 7,030 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPetri Net Based Spatio-temporal Relationships for Moving ObjectsYong-shan Liu, Zhong-xiao HaoThis study presents the spatio-temporal constraint relationships of moving objects by employing Petri Net technology. The spatial constraints of moving objects are first presented in this study based on the V4I[1] theory, then the temporal constraints for moving objects are presented by applying this theory to temporal aspect. With the proposing of Moving Object Petri Net (MOPN) and Spatial Constraint … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,235 accessesView PDFCite
Review ArticleOpen accessIn the keywordsStructural Barriers to the Deployment of AI Foundation ModelsHristo Hristov, Elena Somova, Emil FuchedzhievArtificial Intelligence (AI) foundation models excel at benchmarks but are not always cost-effective or successfully deployed in enterprise systems. This paper analyzes the failures in their deployment through interconnected structural components characterized by: Economic constraints (computational costs, memory, and latency that scale with increasing use of AI model services), cognitive constraints (related to training objectives that optimize plausibility rather than … …Journal of Computer Science, Vol. 22, Issue 10 · 5 Oct 2026 · 808 accessesView PDFCite