papers:ezra_stallings
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
papers:ezra_stallings [2014/10/16 17:46] – [Indefinitely Scalable Active Sensing in a Sparsely Populated Conflict] vyross | papers:ezra_stallings [2014/12/01 21:45] (current) – vyross | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Finding | + | ====== |
- | + | {{: | |
- | + | {{: | |
- | ===== Abstract ===== | + | |
- | + | ||
- | When dealing with the problem of making highly scalable systems, we often have to forgo a number of luxuries. In the Movable Feast Machine (MFM), a simulated architecture for an infinite computer, some of these sacrifices make traditional computation difficult; a lack of global scope, a highly limited local scope, and asynchronous execution all complicate a number of traditional computing problems. | + | |
- | + | ||
- | We took on the problem of finding other elements in a sparsely populated system using an active sensing system, in which we have a " | + | |
- | + | ||
- | ===== Conclusion ===== | + | |
- | + | ||
- | This method for pathfinding works well for sparse structures, demonstrating both an ability for the concept to work with a clear goal in the context of a more complex system (the conflict) and an ideal density level for the system to allow pathfinding to work well. If the machine is too sparsely populated, it can take scouts far too long to find their adversaries, | + |
papers/ezra_stallings.1413481614.txt.gz · Last modified: 2014/10/16 17:46 by vyross