Sciweavers

2095 search results - page 354 / 419
» Improved pebbling bounds
Sort
View
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
13 years 10 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
ADHOC
2007
173views more  ADHOC 2007»
13 years 10 months ago
QoS multicast routing by using multiple paths/trees in wireless ad hoc networks
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blo...
Huayi Wu, Xiaohua Jia
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
13 years 10 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 10 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
AUTOMATICA
2007
154views more  AUTOMATICA 2007»
13 years 10 months ago
A globally stable saturated desired compensation adaptive robust control for linear motor systems with comparative experiments
The recently proposed saturated adaptive robust controller is integrated with desired trajectory compensation to achieve global stability with9 much improved tracking performance....
Yun Hong, Bin Yao