316 search results - page 47 / 64 » On almost self-complementary graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
MCS
2010
Springer
13 years 9 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
JEA
2008
13 years 7 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Peer-to-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find cont...