Posts with #Netlogo

#Netlogo

Public posts on X that use #Netlogo.

Related hashtags

  1. NetLogo@netlogo
    🎉1st ever NetLogo conference this summer June 29-July 1 in Chicago! Calling both researchers & educators: Share your ABM research, educational ideas & creative approaches with the NetLogo community. 📝 Proposals/abstracts open now → #NetLogo #ABM
    09133.2K
  2. NetLogo@netlogo
    How do you make complex systems accessible to kids? Uri Wilensky, creator of #NetLogo, has an answer: let them build and experiment with their own agent-based models using a representation system that is easy-to-learn yet powerful.
    023378
  3. NetLogo@netlogo
    New in NetLogo 7: a Chladni Plate model you can run in your browser. Emergent patterns of sand dancing on sound waves! (explanation below 👇) Play with it here and share your favorite pattern! #NetLogo #Science #Waves #Emergence #ABM
    Download
    4513878
  4. NetLogo@netlogo
    Reminder: 1st ever NetLogo conference this summer June 29-July 1 in Chicago! Share your ABM research, educational ideas & creative approaches with the NetLogo community. 📝 Proposals/abstracts open now → #NetLogo #ABM
    04101.7K
  5. Asjad Naqvi@AsjadNaqvi
    A part of my dissertation was an agent-based model (ABM) on probabilistic displacement determined by economic indicators, shock size, and network topography. For this I had to code and incorporate #Dijkstra algorithm in my #Netlogo code (around 2009-10). Getting this to work was one of the most exciting things since it is at the heart of the model! The algorithm itself is inefficient since it does a full graph search either based on distances (path lengths) or number of nodes crossed (hops). It is superceded by the A* algorithm which is a "greedy" heuristic crawl on a network that reduces the search time significantly. BUT most of the graph network measures, such as betweenness and centrality, implemented in R, Python, C++ etc still use Dijkstra as the main algorithm. It is also the core algorithm for measures that involve distances along weighted links.
    Download
    MIT CSAIL @MIT_CSAIL
    Happy birthday to the late Edsger Dijkstra, whose algorithm solved the “single-source shortest path” problem: (Nathaniel Fan, @Reddit)
    04217.6K
  6. MIT CSAIL✓@MIT_CSAIL
    Happy birthday to the late Edsger Dijkstra, whose algorithm solved the “single-source shortest path” problem: (Nathaniel Fan, @Reddit)
    Download
    71921.1K129K
  7. NetLogo@netlogo
    Ant Adaptation, developed by @KitCMartin, is one of our new models in #NetLogo 6.1. Explore the #complexity of #ants and colonies in this game by controlling ant parameters (like aggression and size) and system features (like food sources and chemical trails). On desktop and web!
    Download
    11136
  8. Luca Cozzuto@lucacozzuto
    Aaaaaand on the 3rd day of the hackathon, I got the Spinning Jenny (by @VisonaNicola ) as a @nf_core pipeline! Dear @netlogo users, you can use #netlogo inside a Nextflow pipeline now for maximizing parallelization, portability, and reproducibility!
    025568
  9. Jen Badham@JenniferBadham
    My #NetLogo tutorial is at Intended for complete beginners, it also covers thinking from #ABM perspective and coding practices
    0312
  10. Silvia Leoni@sil_via_leo
    Back in the same room where I had my Viva to deliver a course of Intro to #NetLogo to the new PhD students in QM @UniMC. Thrilled to be here again and sharing what I Iearned when sitting in these very desks
    Download
    12191.1K
  11. Show more posts