1301 search results - page 167 / 261 » Bounded Version Vectors |
138
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
AAAI
2000
15 years 3 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
138
click to vote
ORDER
2008
15 years 2 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
119
click to vote
AUTOMATICA
2005
15 years 2 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
115
click to vote
TCS
2008
15 years 2 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...