In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
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...
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...