Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
Fuente:
arXiv
Guardado en:
| Autores principales: | Zhang, Taining, Goldstein, Adam, Levin, Michael |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Convergence and Running Time of Time-dependent Ant Colony Algorithms
por: Manthey, Bodo, et al.
Publicado: (2025)
por: Manthey, Bodo, et al.
Publicado: (2025)
A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments
por: Singhvi, Vivaan, et al.
Publicado: (2025)
por: Singhvi, Vivaan, et al.
Publicado: (2025)
Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks
por: Lynch, Nancy A.
Publicado: (2024)
por: Lynch, Nancy A.
Publicado: (2024)
Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints
por: Liu, Dan-Xuan, et al.
Publicado: (2024)
por: Liu, Dan-Xuan, et al.
Publicado: (2024)
The Runtime of Random Local Search on the Generalized Needle Problem
por: Doerr, Benjamin, et al.
Publicado: (2024)
por: Doerr, Benjamin, et al.
Publicado: (2024)
Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
por: Bendahi, Abderrahim, et al.
Publicado: (2025)
por: Bendahi, Abderrahim, et al.
Publicado: (2025)
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
por: Doerr, Benjamin, et al.
Publicado: (2023)
por: Doerr, Benjamin, et al.
Publicado: (2023)
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
por: Doerr, Benjamin, et al.
Publicado: (2023)
por: Doerr, Benjamin, et al.
Publicado: (2023)
Learning to Approximate Uniform Facility Location via Graph Neural Networks
por: Qian, Chendi, et al.
Publicado: (2026)
por: Qian, Chendi, et al.
Publicado: (2026)
Hyper-Heuristics Can Profit From Global Variation Operators
por: Doerr, Benjamin, et al.
Publicado: (2024)
por: Doerr, Benjamin, et al.
Publicado: (2024)
Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
por: Doerr, Benjamin, et al.
Publicado: (2022)
por: Doerr, Benjamin, et al.
Publicado: (2022)
Which Algorithms Can Graph Neural Networks Learn?
por: Wittig, Solveig, et al.
Publicado: (2026)
por: Wittig, Solveig, et al.
Publicado: (2026)
Abstraction in Neural Networks
por: Lynch, Nancy
Publicado: (2024)
por: Lynch, Nancy
Publicado: (2024)
A First Runtime Analysis of the NSGA-II on a Multimodal Problem
por: Doerr, Benjamin, et al.
Publicado: (2022)
por: Doerr, Benjamin, et al.
Publicado: (2022)
Training Neural Networks is NP-Hard in Fixed Dimension
por: Froese, Vincent, et al.
Publicado: (2023)
por: Froese, Vincent, et al.
Publicado: (2023)
Covered Forest: Fine-grained generalization analysis of graph neural networks
por: Vasileiou, Antonis, et al.
Publicado: (2024)
por: Vasileiou, Antonis, et al.
Publicado: (2024)
Local search for valued constraint satisfaction parameterized by treedepth
por: Kaznatcheev, Artem
Publicado: (2024)
por: Kaznatcheev, Artem
Publicado: (2024)
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
por: Hertrich, Christoph, et al.
Publicado: (2021)
por: Hertrich, Christoph, et al.
Publicado: (2021)
Stringology-Based Motif Discovery from EEG Signals: an ADHD Case Study
por: Dahan, Anat, et al.
Publicado: (2026)
por: Dahan, Anat, et al.
Publicado: (2026)
Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks
por: Storesund, Simen, et al.
Publicado: (2025)
por: Storesund, Simen, et al.
Publicado: (2025)
Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
por: Li, Jianfei, et al.
Publicado: (2024)
por: Li, Jianfei, et al.
Publicado: (2024)
Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
por: Doerr, Benjamin, et al.
Publicado: (2026)
por: Doerr, Benjamin, et al.
Publicado: (2026)
Exact Algorithms for Resource Reallocation Under Budgetary Constraints
por: Das, Arun Kumar, et al.
Publicado: (2025)
por: Das, Arun Kumar, et al.
Publicado: (2025)
SquareSort: a cache-oblivious sorting algorithm
por: Koucký, Michal, et al.
Publicado: (2024)
por: Koucký, Michal, et al.
Publicado: (2024)
Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle
por: Kim, Jaekwang, et al.
Publicado: (2023)
por: Kim, Jaekwang, et al.
Publicado: (2023)
Smooth Routing in Decaying Trees
por: Fluschnik, Till, et al.
Publicado: (2026)
por: Fluschnik, Till, et al.
Publicado: (2026)
Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading
por: Adiga, Abhijin, et al.
Publicado: (2024)
por: Adiga, Abhijin, et al.
Publicado: (2024)
Time and Supply Fairness in Electricity Distribution using $k$-times bin packing
por: Baghel, Dinesh Kumar, et al.
Publicado: (2026)
por: Baghel, Dinesh Kumar, et al.
Publicado: (2026)
Genetic Algorithm-based Routing and Scheduling for Wildfire Suppression using a Team of UAVs
por: John, Josy, et al.
Publicado: (2024)
por: John, Josy, et al.
Publicado: (2024)
ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
por: Abrahamsen, Mikkel
Publicado: (2024)
por: Abrahamsen, Mikkel
Publicado: (2024)
Group Trip Planning Query Problem with Multimodal Journey
por: Ali, Dildar, et al.
Publicado: (2025)
por: Ali, Dildar, et al.
Publicado: (2025)
On the Power of Spatial Locality on Online Routing Problems
por: Guragain, Swapnil, et al.
Publicado: (2025)
por: Guragain, Swapnil, et al.
Publicado: (2025)
Mimicry and the Emergence of Cooperative Communication
por: Cope, Dylan, et al.
Publicado: (2024)
por: Cope, Dylan, et al.
Publicado: (2024)
Social Reality Construction via Active Inference: Modeling the Dialectic of Conformity and Creativity
por: Nomura, Kentaro, et al.
Publicado: (2026)
por: Nomura, Kentaro, et al.
Publicado: (2026)
Calibrating Agent-Based Financial Markets Simulators with Pretrainable Automatic Posterior Transformation-Based Surrogates
por: Jiang, Boquan, et al.
Publicado: (2026)
por: Jiang, Boquan, et al.
Publicado: (2026)
Learning to Act and Cooperate for Distributed Black-Box Consensus Optimization
por: Qin, Zi-Bo, et al.
Publicado: (2026)
por: Qin, Zi-Bo, et al.
Publicado: (2026)
Optimally Improving Cooperative Learning in a Social Setting
por: Haddadan, Shahrzad, et al.
Publicado: (2024)
por: Haddadan, Shahrzad, et al.
Publicado: (2024)
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
por: Cosson, Romain, et al.
Publicado: (2025)
por: Cosson, Romain, et al.
Publicado: (2025)
The Free-Market Algorithm: Self-Organizing Optimization for Open-Ended Complex Systems
por: Jaraiz, Martin
Publicado: (2026)
por: Jaraiz, Martin
Publicado: (2026)
How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
por: Gila, Ofek, et al.
Publicado: (2026)
por: Gila, Ofek, et al.
Publicado: (2026)
Ejemplares similares
-
Convergence and Running Time of Time-dependent Ant Colony Algorithms
por: Manthey, Bodo, et al.
Publicado: (2025) -
A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments
por: Singhvi, Vivaan, et al.
Publicado: (2025) -
Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks
por: Lynch, Nancy A.
Publicado: (2024) -
Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints
por: Liu, Dan-Xuan, et al.
Publicado: (2024) -
The Runtime of Random Local Search on the Generalized Needle Problem
por: Doerr, Benjamin, et al.
Publicado: (2024)