2957 search results - page 465 / 592 » The Complexity of Polynomial-Time Approximation |
ALGORITHMICA
2000
13 years 9 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
SIAMAM
2000
13 years 8 months ago
2000
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
PE
2002
Springer
13 years 8 months ago
2002
Springer
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...
SIAMCOMP
2002
13 years 8 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
JCST
2010
13 years 7 months ago
2010
Surface triangle meshes and volume data are two commonly used representations of digital geometry. Converting from triangle meshes to volume data is challenging, since triangle mes...