Research Publications
All | |
| Narrow your search | 283 result(s) |
By Type
By Year By Research Group | A key challenge in developing efficient local search solvers is to effectively minimise search stagnation (i.e. avoiding traps or local minima). A majority of the state-of-the-art local search solvers perform random and/or Novelty-based walks to overcome ... This paper considers the restoration of multiple interdependent infrastructures after a man-made or natural disaster. Modern infrastructures feature complex cyclic interdependencies and require a holistic restoration process. This paper presents the ... This paper studies the applicability of the linearized DC model in optimizing power restoration after significant network disruptions. In such circumstances, no AC base-point solution exists and the objective is to maximize the served load. The paper ... This paper studies the applicability of the linearized DC model in optimizing power restoration after significant network disruptions. In such circumstances, no AC base-point solution exists and the objective is to maximize the served load. The paper ... Constraints can be exploited in paradigms outside of constraint programming. In particular, powerful global constraints can often be decomposed into small primitives and these decompositions can simulate complex propagation algorithms that perform ... We describe a pathfinding system based on Jump Point Search (JPS): a recent and very successful search strategy that performs symmetry breaking to speed up optimal pathfinding on grid maps. We first modify JPS for grid maps where corner-cutting moves are ... In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider the use of voting tree rules to aggregate agents’ preferences. In a voting ... A model of story generation recently proposed by Riedl and Young (2010) casts it as planning, with the additional condition that story characters behave intentionally. This means that characters have perceivable motivation for the actions they take. I ... We present a novel method for computing increasing lower bounds on the cost of solving planning problems, based on repeatedly solving and strengthening the delete relaxation of the problem. Strengthening is done by compiling select conjunctions into ... |