4378 search results - page 48 / 876 » On the Complexity of Ordered Colourings |
AAAI
1997
13 years 10 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
NIPS
2000
13 years 10 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
AAAI
2011
12 years 9 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
KR
1992
Springer
14 years 28 days ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
WSCG
2004
13 years 10 months ago
2004
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...