148 search results - page 27 / 30 » Optimizing random walk search algorithms in P2P networks |
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
GECCO
2009
Springer
14 years 5 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
UAI
2004
14 years 7 days ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
JUCS
2007
13 years 10 months ago
2007
: Generating composite human motion such as locomotion and gestures is important for interactive applications, such as interactive storytelling and computer games. In interactive s...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...