Skip to search formSkip to main contentSkip to account menu

PLS (complexity)

Known as: PLS 
In computational complexity theory, Polynomial Local Search (PLS) is a complexity class that models the difficulty of finding a locally optimal… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Complete (complexity)Complexity classComputational complexity theoryImplicit graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Reference Line Guided Pareto Local Search for Bi-Objective Traveling Salesman Problem
In this paper, a reference line guided Pareto local search (RLG-PLS) is proposed for combinatorial bi-objective optimization… 
2016
2016
Building SVM and PNN optimal classifiers based on GA-PLS algorithm and the application in infrared spectrum
Olefin infrared spectrum is a comprehensive presentation of its feature data. If the structures are different, it will certainly… 
2013
2013
A Multiobjective Memetic Algorithm for Solving the Carsharing Problem
— In this article, we present a method combining a genetic approach with a local search for multiobjective problems. It is an… 
2013
2013
The multi-space generalization of total projection to latent structures (MsT-PLS) and its application to online process monitoring
In the present work, the multiplicity of process variable spaces is analyzed for modern industrial processes where a large number… 
2012
2012
Industrial applications of locally weighted PLS to realize maintenance-free high-performance virtual sensing
Virtual sensing technology is crucial to realize high product quality and productivity in any industry, but model maintenance is… 
2010
2010
SOME REMARKS ON NONLINEAR RELATIONSHIPS IN PLS PATH MODELING
Structural Equation Models (SEMs) are widely used to model complex causal relationships, especially in economic and social… 
2010
2010
Product Customer Satisfaction Optimized Model Based on GA-PLS
In order to solve the difficulty — how to choose elements of product performance and price — and the distortion problem caused by… 
2009
2009
Benchmarking reservoir computing on time-independent classification tasks
This paper presents an extensive evaluation of reservoir computing for the case of classification problems that do not depend on… 
2009
2009
An improved QSPR study of the toxicity of aliphatic carboxylic acids using genetic algorithm
Toxicity of 38 aliphatic carboxylic acids was studied by using a quantitative structure–activity relationship (QSAR) method and… 
Review
2009
Review
2009
Congestion games: Equilibria, convergence and complexity
Congestion games model the allocation of resources by selfish players. For example, players aim at allocating shortest paths in a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)