Results 281 to 290 of about 379,550 (314)
Some of the next articles are maybe not open access.
International Review of Qualitative Research, 2011
This letter documents the conversations of a participatory action research team consisting of one doctoral student and eight New York City high school students. The letter documents the process of creating the instrument that was used to collect data from other lesbian, gay, bisexual, transgender, and queer and questioning students.
openaire +1 more source
This letter documents the conversations of a participatory action research team consisting of one doctoral student and eight New York City high school students. The letter documents the process of creating the instrument that was used to collect data from other lesbian, gay, bisexual, transgender, and queer and questioning students.
openaire +1 more source
Emerge-Sort: Swarm Intelligence Sorting
2012We 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
Introduction … of Sorts, Sort of
2012This 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
Bead-sort: A natural sorting algorithm
Bull. EATCS, 2002Summary: 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
A MIP-based approach to learn MR-Sort models with single-peaked preferences
Annals of Operations Research, 2022Vincent Mousseau +2 more
exaly