On the Energy Optimization for Precedence Constrained Applications using Local Search Algorithms

In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSSes) and Minimally Unsatisfiable Subformulas (MUSes) of sets of Boolean clauses is intro- duced..

(2014) introduced an Iterated Local Search (ILS) (Lourenço et al., 2003) metaheuristic for the CC problem, which outperformed, in processing time, the GRASP metaheuristic

In this paper we focus on Upper Confidence Bound (UCB) bandit algorithms [ACBF02] applied to tree search, such as UCT (Upper Confidence Bounds applied to Trees) [KS06]. A reward

Tree and local search for parallel machine scheduling problems with precedence constraints and setup times.. Bernat Gacias, Christian Artigues,

This paper thus proposes a CBR based approach that, given the problem characteristics and requirements, and considering an historic CB log of past executions of each

In fact, global-scale algorithms for community detection may perform badly in the case of medium and large scale networks: since social graphs become too complex at the global level,

In this work, the idea of a factor which minimizes the time to search the solution space by heuristic algorithms is presentedI. The proposed modification is described and tested

Key words: costs-to-move, decision dynamics, exploration process, friction, inertia, local optimization, local search algorithms, proximal algorithms, worthwhile-to-move