1310 search results - page 258 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
ICDCN
2011
Springer
13 years 1 days ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
CC
2007
Springer
13 years 8 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ICS
2005
Tsinghua U.
14 years 2 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
IJRR
2010
13 years 7 months ago
2010
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...
PE
2010
Springer
13 years 7 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...