Sciweavers

143 search results - page 6 / 29
» Sorting and Selection in Posets
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
TSP
2008
167views more  TSP 2008»
13 years 6 months ago
Multi-Task Learning for Analyzing and Sorting Large Databases of Sequential Data
A new hierarchical nonparametric Bayesian framework is proposed for the problem of multi-task learning (MTL) with sequential data. The models for multiple tasks, each characterize...
Kai Ni, John William Paisley, Lawrence Carin, Davi...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
SAC
2010
ACM
14 years 2 months ago
External sorting for index construction of large semantic web databases
Today’s Semantic Web datasets become increasingly larger containing up to several hundred million triples. The performance of index construction is a crucial factor for the succ...
Sven Groppe, Jinghua Groppe
GECCO
2003
Springer
245views Optimization» more  GECCO 2003»
14 years 24 days ago
A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
Abstract. This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO...
Xiaodong Li