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.
2012
2012
Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT… 
2009
2009
Wireless sensor networks suffer from the problems of congestion, which lead to packet loss and excessive energy consumption. In… 
Review
2008
Review
2008
The field of evolutionary computation has traditionally focused on static optimisation problems but recently, many new approaches… 
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… 
Review
2004
Review
2004
Abstract.We survey the main results presented in the author’s PhD Thesis presented in June 2003 at the Université catholique de… 
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
Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run…