Sciweavers

143 search results - page 10 / 29
» Sorting and Selection in Posets
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
IJBIS
2010
145views more  IJBIS 2010»
13 years 4 months ago
A multi-attribute group decision support system for information technology project selection
: The increasing intensity of global competition and the rapid advances in information technology (IT) have led organisations to search for more efficient and effective ways to man...
Faramak Zandi, Madjid Tavana
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
EMO
2005
Springer
194views Optimization» more  EMO 2005»
14 years 1 months ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
ICML
2005
IEEE
14 years 8 months ago
Online feature selection for pixel classification
Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a...
Karen A. Glocer, Damian Eads, James Theiler