Accelerating backtrack search with a best-first-search strategy
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)
Mathematical Problems in Engineering
Similarity:
Hadda Cherroun, Alain Darte, Paul Feautrier (2007)
RAIRO - Operations Research
Similarity:
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...
Roman Dębski (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
E. Loehman, Ph. T. Nghiem, A. Whinston (1970)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Renaud Sirdey, Hervé L. M. Kerivin (2007)
RAIRO - Operations Research
Similarity:
This paper is devoted to the exact resolution of a strongly -hard resource-constrained scheduling problem, the , which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance, in terms of both exact...
Nedeljko Ostojić, Dušan Starčević (2000)
The Yugoslav Journal of Operations Research
Similarity:
Ghoseiri, Keivan, Morshedsolouk, Fahimeh (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity:
Yaoyao He, Jianzhong Zhou, Ning Lu, Hui Qin, Youlin Lu (2010)
Kybernetika
Similarity:
Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional...
Michel Vasquez, Audrey Dupont, Djamal Habet (2003)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.