265 search results - page 51 / 53 » The independence number in graphs of maximum degree three |
GECCO
2009
Springer
14 years 17 days ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
BMCBI
2005
13 years 5 months ago
2005
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
TVCG
2008
13 years 5 months ago
2008
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
CCGRID
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...