3958 search results - page 109 / 792 » Dynamic Graph Algorithms with Applications |
188
Voted
WMCSA
2002
IEEE
15 years 10 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
148
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
163
Voted
IWOCA
2010
Springer
14 years 12 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
141
Voted
IPSN
2003
Springer
15 years 10 months ago
2003
Springer
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant moti...
125
click to vote
CCGRID
2009
IEEE
15 years 12 months ago
2009
IEEE
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...