Local search procedures for solving satisfiability problems have attracted considerable
attention since the development of GSAT in 1992. However, recent work indicates that for …

Representing and reasoning about time dependent information is a key research issue in
many areas of computer science and artificial intelligence. One of the best known and widely …

摘要骨架是指一个NP-难解问题实例的所有全局最优解的相同部分, 因其在启发式算法设计中的
重要作用而成为该领域的研究热点. 本文对目前骨架及相关概念的研究成果进行了全面综述 …

This comparative study examines the impact of backbone guided heuristics on the
performance of dynamic local search methods. We study alternatives to the backbone …

NICTA was established with two main objectives: to undertake leading fundamental
research in ICT and to develop outcomes of commercial or national benefit from this …

NICTA is Australia's Information and Communications Technology (ICT) Centre of
Excellence. It is the largest organization in Australia dedicated to ICT research. While it has …

Recent times have seen the development of planners that exploit advances in SAT
(isfiability) solving technology to achieve good performance. In that spirit we develop the …

Recent research has shown that it is often preferable to encode real-world problems as
propositional satis ability (SAT) problems, and then solve them using general purpose SAT …