Results 281 to 290 of about 499,399 (313)
Some of the next articles are maybe not open access.

Emerge-Sort: Swarm Intelligence Sorting

2012
We examine sorting on the assumption we do not know in advance which way to sort. We use simple local comparison and swap operators and demonstrate that their repeated application ends up in sorted sequences. These are the basic elements of Emerge-Sort, an approach to self-organizing sorting, which we experimentally validate and observe a run-time ...
Dimitris Kalles   +2 more
openaire   +1 more source

Multidimensional Sorting

SIAM Journal on Computing, 1983
Jacob E. Goodman, Richard Pollack
openaire   +2 more sources

Incomplete lineage sorting and phenotypic evolution in marsupials

Cell, 2022
Shaohong Feng, Ming Bai, Shiping Liu
exaly  

Introduction … of Sorts, Sort of

2012
This introduction most likely has already been written (or at least some variation of) by many who have thrown themselves over the precipice and have fallen smack into the formidable theoretical edifice that the three key figures of the book’s title present: Lacan, Deleuze, and Žižek. Flattened by the fall, one slides down, arms outstretched in despair.
openaire   +1 more source

Cell surface fluctuations regulate early embryonic lineage sorting

Cell, 2022
Elena Corujo-Simon   +2 more
exaly  

Puzzled: A Sort, of Sorts

Communications of the ACM, 2014
openaire   +1 more source

Sorting, sorted!

Nature Reviews Immunology, 2016
openaire   +1 more source

Bead-sort: A natural sorting algorithm

Bull. EATCS, 2002
Summary: Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In this note, a simple natural phenomenon is used to design a sorting algorithm for positive integers, called here bead-sort. The algorithm's run-time complexity ranges
Joshua J. Arulanandham   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy