1651 search results - page 234 / 331 » Measuring the Complexity of Classification Problems |
WG
2005
Springer
14 years 1 months ago
2005
Springer
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 ...
ICGI
2004
Springer
14 years 1 months ago
2004
Springer
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 ...
SEM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A challenging software engineering problem is the design and implementation of component-based (CB) applications that can meet specified performance requirements. Our PPC...
ICRA
2000
IEEE
14 years 20 days ago
2000
IEEE
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 ...
ECBS
2010
IEEE
13 years 11 months ago
2010
IEEE
Simple, stateless networking protocols provide a low-cost and predictable foundation upon which to build decentralised applications. Sensornets are complex, containing emergent be...