1434 search results - page 150 / 287 » Distributed Computing with Imperfect Randomness |
JMIV
2002
14 years 11 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
86
Voted
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
ICPPW
2006
IEEE
15 years 5 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...