Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
We explore strategies to resolve conflicts in multiagent environments that arise when agents compete for resources they need for survival and procreation. As expected, social str...
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
This paper presents results from a desktop experiment in which the participants’ route selection behavior in an unknown street network is investigated. The participants were pres...