Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
We introduce a distributed camera coalition formation scheme for perceptive scene coverage and persistent surveillance by smart camera sensor networks. The proposed model supports...
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...