674 search results - page 6 / 135 » The computational complexity of the parallel knock-out probl... |
IPPS
2003
IEEE
14 years 20 days ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Advances in high-performance computing have led to the broad use of computational studies in everyday engineering and scientific applications. A single study may require thousand...
GRID
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
PODC
2010
ACM
13 years 5 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
FAC
2002
13 years 7 months ago
2002
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...