Sciweavers

11328 search results - page 39 / 2266
» Timed Branching Processes
Sort
View
ICIAP
2003
ACM
16 years 2 months ago
Depth-first k-nearest neighbor finding using the MaxNearestDist estimator
A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch and ...
Hanan Samet
ICCD
2003
IEEE
107views Hardware» more  ICCD 2003»
15 years 11 months ago
Improving Branch Prediction Accuracy in Embedded Processors in the Presence of Context Switches
Embedded processors like Intel’s XScale use dynamic branch prediction to improve performance. Due to the presence of context switches, the accuracy of these predictors is reduce...
Sudeep Pasricha, Alexander V. Veidenbaum
CP
2008
Springer
15 years 3 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
AAAI
2004
15 years 3 months ago
Branching Storylines in Virtual Reality Environments for Leadership Development
Simulation-based training is increasingly being used within the military to practice and develop the skills of successful soldiers. For the skills associated with successful milit...
Andrew Gordon, Michael van Lent, Martin Van Velsen...
MAM
2007
90views more  MAM 2007»
15 years 1 months ago
Clustered indexing for branch predictors
ct 8 As a result of resource limitations, state in branch predictors is frequently shared between uncorrelated branches. This interference 9 can significantly limit prediction acc...
Veerle Desmet, Hans Vandierendonck, Koen De Bossch...