Sciweavers

1503 search results - page 118 / 301
» Self-optimizing distributed trees
Sort
View
EOR
2010
102views more  EOR 2010»
13 years 10 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 10 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
JSYML
2008
72views more  JSYML 2008»
13 years 10 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
TMC
2008
138views more  TMC 2008»
13 years 10 months ago
A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling amon...
Luca Mottola, Gianpaolo Cugola, Gian Pietro Picco
MICS
2010
134views more  MICS 2010»
13 years 8 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara