1945 search results - page 90 / 389 » Pursuit-Evasion in Models of Complex Networks |
DCOSS
2010
Springer
14 years 29 days ago
2010
Springer
Abstract. Current programming interfaces for sensor networks often target experienced developers and lack important features. Tables is a spreadsheet inspired programming environme...
ICAI
2003
13 years 9 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
WSC
2004
13 years 9 months ago
2004
This paper explores current metaphors for visualizing agent-based models. Metaphors include grid, network, ndimensional cubes and landscape visualization techniques. A final secti...
MMB
2001
Springer
14 years 18 days ago
2001
Springer
E-business workloads are quite complex as demonstrated by the hierarchical workload characterization discussed here. While these features may pose challenges to performance model ...
JUCS
2007
13 years 8 months ago
2007
: In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from ...