In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created ...
Abstract. A challenging software engineering problem is the design and implementation of component-based (CB) applications that can meet specified performance requirements. Our PPC...
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
Simple, stateless networking protocols provide a low-cost and predictable foundation upon which to build decentralised applications. Sensornets are complex, containing emergent be...