Constraint satisfaction problems CSPs are widely used in Arti cial Intelligence The problem of the exist ence of a solution in a CSP being NP complete ltering techniques and particularly arc consistency are essen tial They remove some local inconsistencies and so make the search easier Since many problems in AI require a dynamic environment the model was exten ded to dynamic CSPs DCSPs and some...

In certain circumstances an individual may not be in control of their private location information and thus vulnerable to a privacy violation. In this paper, we ensure location privacy through the establishment of a prohibitive contract in a situation where an individual wishes to minimize privacy loss and a service provider aims to maximize profits. Given the possible strategies we show that a...

Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR). This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity. We show that the gap between non-plan...

Previous research has shown that chimpanzees exploit the behavior of humans and conspecifics more readily in a competitive than a cooperative context. However, it is unknown whether bonobos, who outperform chimpanzees in some cooperative tasks, also show greater cognitive flexibility in competitive contexts. Here we tested the cooperative-competitive hypothesis further by comparing bonobos and ...