Nondeterministic polynomial time factoring in the tile assembly model
Theoretical Computer Science
Solving NP-complete problems in the tile assembly model
Theoretical Computer Science
Solving satisfiability in the tile assembly model with a constant-size tileset
Journal of Algorithms
Software Engineering for Self-Adaptive Systems: A Research Roadmap
Software Engineering for Self-Adaptive Systems
Engineering Self-Adaptive Systems through Feedback Loops
Software Engineering for Self-Adaptive Systems
Toward evolving self-organizing software systems: a complex system point of view
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Hi-index | 0.00 |
Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for computational Internet-sized systems exists. We propose a software architectural style for large networks, based on a formal mathematical study of crystal growth that will exhibit properties of (1) discreetness (nodes on the network cannot learn the algorithm or input of the computation), (2) fault-tolerance (malicious, faulty, and unstable nodes may not break the computation), and (3) scalability (communication among the nodes does not increase with network or problem size).