Abstract. Multiagent cooperative negotiation is a promising technique for modeling and controlling complex systems. Effective and flexible cooperative negotiations are especially...
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
This paper presents a system for dynamic network reconfiguration based on intelligent agents and market–oriented methods. Reconfiguration encompasses routing changes as well as b...
Artur Maj, Jaroslaw Jurowicz, Jaroslaw Kozlak, Krz...
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
— We describe a distributed boundary detection algorithm suitable for use on multi-robot systems with dynamic network topologies. We assume that each robot has access to its loca...