Sciweavers

21 search results - page 5 / 5
» Solving NP-Complete Problems Using P Systems with Active Mem...
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 9 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....