Sciweavers

868 search results - page 18 / 174
» Dynamic Connectivity: Connecting to Networks and Geometry
Sort
View
AAMAS
2007
Springer
13 years 7 months ago
A formal framework for connective stability of highly decentralized cooperative negotiations
Abstract. Multiagent cooperative negotiation is a promising technique for modeling and controlling complex systems. Effective and flexible cooperative negotiations are especially...
Francesco Amigoni, Nicola Gatti
RSA
2008
123views more  RSA 2008»
13 years 7 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
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, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CEEMAS
2003
Springer
14 years 23 days ago
A Multi-agent System for Dynamic Network Reconfiguration
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...
COCOA
2007
Springer
14 years 1 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: 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...
Eric J. Friedman, Adam Scott Landsberg
IROS
2009
IEEE
114views Robotics» more  IROS 2009»
14 years 2 months ago
A Distributed boundary detection algorithm for multi-robot systems
— 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...
James McLurkin, Erik D. Demaine