5331 search results - page 462 / 1067 » Algebraic Methods for Optimization Problems |
198
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
179
click to vote
EXPCS
2007
15 years 10 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
210
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
166
click to vote
AAAI
2006
15 years 8 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
145
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Quantization, defined as the act of attributing a finite number of grey-levels to an image, is an essential task in image acquisition and coding. It is also intricately linked to ...