134 search results - page 25 / 27 » Combinatorics of diagrams of permutations |
CPM
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
AIR
2010
13 years 6 months ago
2010
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
DM
2011
12 years 9 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
COCOON
2009
Springer
14 years 19 days ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
DAC
1999
ACM
13 years 10 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...