194 search results - page 13 / 39 » Better polynomials for GNFS |
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
SNPD
2004
13 years 11 months ago
2004
We proposed a new approach to compare profiles when the correlations among attributes can be represented as a tree. To account for these correlations, the profile is extended with...
AAAI
1994
13 years 11 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...