1302 search results - page 191 / 261 » On the Strong Chromatic Number |
178
click to vote
PAA
2002
15 years 6 months ago
2002
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...
159
click to vote
SCP
1998
15 years 6 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
173
click to vote
RSA
2002
15 years 6 months ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
178
click to vote
MST
2007
15 years 5 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
174
click to vote
NETWORKS
2007
15 years 5 months ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...