Skip to search formSkip to main contentSkip to account menu

Discrete optimization

Known as: Discrete, Discrete optimisation 
Discrete optimization is a branch of optimization in applied mathematics and computer science.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Reversible data hiding in encrypted images (RDHEI) has recently emerged as an effective approach to protect the confidentiality… 
2015
2015
Motivation. Computer science is about effectively finding solutions that satisfy given specifications. To achieve this goal one… 
2014
2014
We introduce and study the problem in which a mobile sensing robot (our tourist) is tasked to travel among and gather… 
2007
2007
This work introduces the Bees Algorithm, a new optimisation algorithm inspired by the foraging behaviour of honey-bees. In its… 
2007
2007
Harmonic distortion is increasing in distribution power systems due to the proliferation of nonlinear distorting loads. Capacitor… 
2005
2005
Object extraction is a core component of computer vision with application to segmentation, tracking, etc. In this paper we… 
2003
2003
Modern meta-heuristic search strategies are often used to solve discrete optimisation problems with little regard to varying the… 
2002
2002
  • R. Bergamaschi
  • 2002
  • Corpus ID: 7589964
High-level synthesis operates on internal models known as control/data flow graphs (CDFG) and produces a register-transfer-level… 
2001
2001
We consider the use of a fixed gain version of SPSA (simultaneous perturbation stochastic approximation) for optimizing a class… 
1999
1999
The multicriteria problem of majority choice on a system of subsets of a finite set with linear partial criteria (MINSUM) is…