4378 search results - page 186 / 876 » On the Complexity of Ordered Colourings |
164
click to vote
AIPS
2009
15 years 7 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
138
click to vote
APPML
2010
15 years 6 months ago
2010
Abstract. We study existence and qualitative properties of solutions for the abstract fractional relaxation equation (0.1) u (t) - AD t u(t) + u(t) = f(t), 0 < < 1, t 0, u(...
152
click to vote
ANOR
2007
15 years 6 months ago
2007
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
166
click to vote
RSA
2006
15 years 6 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
151
click to vote
INFORMATICALT
2007
15 years 6 months ago
2007
In this article we present the general architecture of a hybrid neuro-symbolic system for the selection and stepwise elimination of predictor variables and non-relevant individuals...