4378 search results - page 137 / 876 » On the Complexity of Ordered Colourings |
JSAT
2006
13 years 10 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
TEC
2002
13 years 10 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
IJON
2008
13 years 8 months ago
2008
This article depicts the approach used to build the Topos application, a simulation of two-wheel robots able to discern real complex sounds. Topos is framed in the nouvelle concep...
ACL
2009
13 years 8 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
DISOPT
2011
13 years 5 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...