Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...