Sciweavers

739 search results - page 88 / 148
» Sorting Algorithms
Sort
View
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 7 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
GECCO
2005
Springer
144views Optimization» more  GECCO 2005»
14 years 1 months ago
Multiobjective hBOA, clustering, and scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
Martin Pelikan, Kumara Sastry, David E. Goldberg
ICDCS
2007
IEEE
14 years 2 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
WCNC
2010
IEEE
13 years 11 months ago
Deploying Wireless Sensors for Differentiated Coverage and Probabilistic Connectivity
—The deployment strategy for achieving differentiated coverage and probabilistic connectivity in wireless sensor networks is studied in this paper. A novel solution based on elit...
Yanjun Li, Ye-Qiong Song, Yi-hua Zhu, René ...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 1 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian