Sciweavers

1629 search results - page 254 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
AAAI
2010
14 years 11 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
MOBIHOC
2005
ACM
15 years 9 months ago
Hybrid sensor networks: a small world
In this paper, we investigate the use of limited infrastructure, in the form of wires, for improving the energy efficiency of a wireless sensor network. We call such a sensor netw...
Gaurav Sharma, Ravi Mazumdar
WWW
2005
ACM
15 years 10 months ago
On the lack of typical behavior in the global Web traffic network
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...
Mark Meiss, Filippo Menczer, Alessandro Vespignani
NAS
2010
IEEE
14 years 7 months ago
A Probabilistic Routing Protocol for Heterogeneous Sensor Networks
The past five years witnessed a rapid development in wireless sensor networks, which have been widely used in military and civilian applications. Due to different requirements in t...
Yuefei Hu, Wenzhong Li, Xiao Chen, Xin Chen, Sangl...
STORAGESS
2005
ACM
15 years 3 months ago
Expecting the unexpected: adaptation for predictive energy conservation
The use of access predictors to improve storage device performance has been investigated for both improving access times, as well as a means of reducing energy consumed by the dis...
Jeffrey P. Rybczynski, Darrell D. E. Long, Ahmed A...