125 search results - page 19 / 25 » Growth of components in random graphs |
AAAI
2010
13 years 9 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
JSAT
2008
13 years 7 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
GRC
2010
IEEE
13 years 7 months ago
2010
IEEE
—Images with GPS coordinates are a rich source of information about a geographic location. Innovative user services and applications are being built using geotagged images taken ...
RANDOM
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...