217 search results - page 33 / 44 » A new upper bound on the cyclic chromatic number |
WG
2005
Springer
15 years 2 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
IPCO
2010
14 years 11 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
96
Voted
IPMI
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a Bayesian multimodality non-rigid image registration method. Since the likelihood is unknown in the general multimodality setting, we use a density estimator ...
AIPS
2008
14 years 11 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...