420 search results - page 22 / 84 » Search on High Degree Graphs |
101
Voted
SAC
2010
ACM
15 years 7 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
103
Voted
WEBI
2009
Springer
15 years 7 months ago
2009
Springer
—In this paper, we investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of largescale, federated ...
168
click to vote
BMCBI
2010
15 years 24 days ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
106
click to vote
WEA
2005
Springer
15 years 6 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
99
Voted
ISCOPE
1999
Springer
15 years 5 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...