Sciweavers

494 search results - page 51 / 99
» The Conference Call Search Problem in Wireless Networks
Sort
View
AIPS
2008
13 years 11 months ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte
STACS
2001
Springer
14 years 1 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
WWW
2003
ACM
14 years 9 months ago
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval
We consider the problem of building a P2P-based search engine for massive document collections. We describe a prototype system called ODISSEA (Open DIStributed Search Engine Archi...
Torsten Suel, Chandan Mathur, Jo-wen Wu, Jiangong ...
FIW
2003
120views Communications» more  FIW 2003»
13 years 10 months ago
A Policy Architecture for Enhancing and Controlling Features
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec, Kenneth J. Turner
DCOSS
2010
Springer
13 years 11 months ago
Wireless Jamming Localization by Exploiting Nodes' Hearing Ranges
Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wid...
Zhenhua Liu, Hongbo Liu, Wenyuan Xu, Yingying Chen