Sciweavers

1376 search results - page 29 / 276
» Searching Trees: An Essay
Sort
View
ISCA
2005
IEEE
126views Hardware» more  ISCA 2005»
15 years 5 months ago
A Tree Based Router Search Engine Architecture with Single Port Memories
Pipelined forwarding engines are used in core routers to meet speed demands. Tree-based searches are pipelined across a number of stages to achieve high throughput, but this resul...
Florin Baboescu, Dean M. Tullsen, Grigore Rosu, Su...
AAAI
2006
15 years 1 months ago
Properties of Forward Pruning in Game-Tree Search
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...
Yew Jin Lim, Wee Sun Lee
NECO
2002
117views more  NECO 2002»
14 years 11 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille
BMCBI
2008
139views more  BMCBI 2008»
14 years 12 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
JACM
2007
132views more  JACM 2007»
14 years 11 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup