4378 search results - page 98 / 876 » On the Complexity of Ordered Colourings |
CIE
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
JCP
2007
13 years 9 months ago
2007
Abstract— This paper deals with the use of Bayesian Networks to compute system reliability of complex systems under epistemic uncertainty. In the context of incompleteness of rel...
CCE
2010
13 years 6 months ago
2010
AbstrAct A comprehensive overview of numerical methodologies currently available for analyzing and building understanding of complex processes is presented. Both equation-free and ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...