801 search results - page 73 / 161 » Minimal Locked Trees |
141
click to vote
AAAI
2006
15 years 7 months ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
162
click to vote
TMC
2008
15 years 6 months ago
2008
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling amon...
186
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
An increasing number of applications use XML data published from relational databases. For speed and convenience, such applications routinely cache this XML data locally and acces...
169
click to vote
SCHEDULING
2008
15 years 5 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
162
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...