60 search results - page 4 / 12 » On Binary Searching with Nonuniform Costs |
ICCAD
2010
IEEE
13 years 3 months ago
2010
IEEE
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
ADC
2004
Springer
13 years 11 months ago
2004
Springer
Document retrieval and web search engines index large quantities of text. The static costs associated with storing the index can be traded against dynamic costs associated with us...
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
DAMON
2009
Springer
13 years 6 months ago
2009
Springer
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...