We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
Pierre Flener, Justin Pearson, Meinolf Sellmann, P...
When we construct an agent by integrating modules, there appear troubles concerning the autonomy of the agent if we introduce a heuristics that dominates the whole agent. Thus, we ...
A fitness function is needed for a Genetic Algorithm (GA) to work, and it appears natural that the combination of objectives and constraints into a single scalar function using ar...
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
In the `missing data' approach to improving the robustness of automatic speech recognition to added noise, an initial process identifies spectraltemporal regions which are do...