832 search results - page 79 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
110
click to vote
AAAI
1997
15 years 2 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
114
Voted
AMC
2004
15 years 15 days ago
2004
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
101
Voted
ICDCN
2010
Springer
15 years 7 months ago
2010
Springer
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
104
Voted
IPPS
2003
IEEE
15 years 6 months 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...
99
Voted
PPL
2006
15 years 17 days ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...