486 search results - page 24 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
PACT
1999
Springer
13 years 12 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
CGO
2006
IEEE
14 years 1 months ago
2006
IEEE
Multicluster architectures overcome the scaling problem of centralized resources by distributing the datapath, register file, and memory subsystem across multiple clusters connec...
GECCO
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
MIDDLEWARE
2004
Springer
14 years 1 months ago
2004
Springer
Several works on grid computing have been proposed in the last years. However, most of them, including available software, can not deal properly with some issues related to contro...