154 search results - page 13 / 31 » Anytime search in dynamic graphs |
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
Link analysis is a key technology in contemporary web search engines. Most of the previous work on link analysis only used information from one snapshot of web graph. Since commer...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
IV
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper introduces Temporal Social Surfaces. Temporal Social Surfaces show the dynamic evolution of social relationships in groups. Changes in measures of social network analys...
IJMC
2006
13 years 8 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...