2842 search results - page 165 / 569 » Expansion and Search in Networks |
223
click to vote
TAINN
2005
Springer
15 years 12 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
164
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
183
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
163
click to vote
ICWSM
2008
15 years 8 months ago
2008
In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hyper...
219
click to vote
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...