Sciweavers

1068 search results - page 159 / 214
» Factorization as a Rank 1 Problem
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
HPDC
2006
IEEE
15 years 3 months ago
Materializing Highly Available Grids
Grids are becoming a mission-critical component in research and industry. The services they provide are thus required to be highly available, contributing to the vision of the Gri...
Mark Silberstein, Gabriel Kliot, Artyom Sharov, As...
AAAI
1996
14 years 11 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
JGAA
2006
120views more  JGAA 2006»
14 years 9 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
IOR
2007
89views more  IOR 2007»
14 years 9 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...