Sciweavers

1623 search results - page 101 / 325
» No Sorting
Sort
View
SIGCSE
2002
ACM
123views Education» more  SIGCSE 2002»
15 years 4 months ago
Algorithms and object-oriented programming: bridging the gap
Currently there is a serious conceptual and technical gap between ideas emphasized in object-oriented programming and ideas as taught in algorithms courses. We suggest both a para...
Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce...
TEC
2002
161views more  TEC 2002»
15 years 4 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
105
Voted
IPMU
2010
Springer
15 years 2 months ago
A Categorical Approach to the Extension of Social Choice Functions
Are we interested in choice functions or function for choice? Was it my choice or did I choose? In the end it is all about sorts and operators, terms as given by the term monad ove...
Patrik Eklund, Mario Fedrizzi, Hannu Nurmi
BSL
2010
15 years 1 months ago
Almost disjoint families and diagonalizations of length continuum
Abstract. We present a survey of some results and problems concerning constructions which require a diagonalization of length continuum to be carried out, particularly construction...
Dilip Raghavan
SIAMDM
2010
105views more  SIAMDM 2010»
14 years 11 months ago
A Lower Bound on the Transposition Diameter
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
Linyuan Lu, Yiting Yang