Results 21 to 30 of about 7,335,515 (304)
Computational Complexity of Discrete Optimization Problems [PDF]
Recent developments in the theory of computational complexity as applied to combinatorial problems have revealed the existence of a large class of so-called NP-complete problems, either all or none of which are solvable in polynomial time. Since many infamous combinatorial problems have been proved to be NP-complete, the latter alternative seems far ...
Lenstra, J.K., Rinnooy Kan, A.H.G.
openaire +2 more sources
Convergence of pseudospectral discretizations of optimal control problems [PDF]
A generic nonlinear optimal control problem with a Bolza cost functional is discretized by a Legendre pseudospectral method. According to the covector mapping theorem, the Karush-Kuhn-Tucker multipliers of the discrete problem map linearly to the spectrally discretized covectors of the Bolza problem.
Ross, Michael I., Fahroo, Fariba
openaire +4 more sources
Binary particle swarm optimization in classification [PDF]
Purpose of this work is to show that the Particle Swarm Optimization Algorithm may improve the results of same well known Machine Learning methods in the resolution of discrete classification problems.
Galván, Inés M. +2 more
core +1 more source
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems [PDF]
Scalarization is a common technique to transform a multiobjective optimization problem into a scalar-valued optimization problem. This article deals with the weighted Tchebycheff scalarization applied to multiobjective discrete optimization problems ...
Helfrich, Stephan +9 more
core +1 more source
Symbiotic organisms search (SOS) is a promising metaheuristic algorithm that has been studied recently by numerous researchers due to its capability to solve various hard and complex optimization problems.
Doddy Prayogo +6 more
doaj +1 more source
Harris Hawks Optimization for Optimum Design of Truss Structures with Discrete Variables [PDF]
This article investigates the use of Harris Hawks Optimization (HHO) to solve planar and spatial trusses with design variables that are discrete. The original HHO has been used to solve continuous design variables problems.
Mustafa Al-Bazoon
doaj
Selected Open Problems in Discrete Geometry and Optimization [PDF]
A list of questions and problems posed and discussed in September 2011 at the following consecutive events held at the Fields Institute, Toronto: Workshop on Discrete Geometry, Conference on Discrete Geometry and Optimization, and Workshop on ...
K. Bezdek +3 more
core +1 more source
Enterotoxigenic Bacteroides fragilis is a gut bacterium linked to bowel cancer. We propose that its toxin acts along two routes: at the cell surface, cutting the adhesion protein E‐cadherin and triggering inflammation; and inside the cell, delivered by bacterial vesicles, switching on NOD1 and cancer stem cell programs.
Kangchan Choi +2 more
wiley +1 more source
Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems
In this paper, a discrete variant of TLBO (DTLBO) is proposed for solving the traveling salesman problem (TSP). In the proposed method, an effective learner representation scheme is redefined based on the characteristics of TSP problem.
Wu Lehui, Zoua Feng, Chen Debao
doaj +1 more source
ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source

