62 search results - page 2 / 13 » Ultra-Perfect Sorting Scenarios |
EKAW
2010
Springer
13 years 3 months ago
2010
Springer
Social Tagging Systems (STS) empower users to classify and organize resources and to improve the retrieval performance over the tagged resources. In this paper we argue that the po...
OFAI
1997
Springer
13 years 8 months ago
1997
Springer
This paper outlines a design-based methodology for the study of mind as a part of thebroaddisciplineofArtificial Intelligence. Withinthat frameworksome architectural requirements...
PODS
2005
ACM
14 years 4 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
CPM
2004
Springer
13 years 8 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...