s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
Carmen B. Navarrete, Susana Holgado, Eloy Anguiano
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...