672 search results - page 67 / 135 » A General Solution to the Graph History Interaction Problem |
PODC
2011
ACM
13 years 13 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Processes of Place/Transition Systems6 Rob van Glabbeeka,b , Ursula Goltzc , Jens-Wolfhard Schickec aNICTA, Sydney, Australia bSchool of Computer Science and Engineering, Universit...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
ICLP
1999
Springer
14 years 1 months ago
1999
Springer
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
OPODIS
2008
13 years 11 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...