Sciweavers

1020 search results - page 82 / 204
» Efficiency of Search Methods in Dynamic Wireless Networks
Sort
View
CP
2006
Springer
13 years 11 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
MOBIHOC
2004
ACM
14 years 7 months ago
Locating cache proxies in manets
Caching Internet based services is a potentially important application for MANETs, as it can improve mobile users' perceived quality of service, reduce their energy consumpti...
Roy Friedman, Maria Gradinariu, Gwendal Simon
ONDM
2001
13 years 9 months ago
Traffic Load Bounds for Optical Burst-Switched Networks with Dynamic Wavelength Allocation
: The maximum traffic load that can be supported by a wavelength division multiplexed (WDM) optical burst switched (OBS) network with dynamic wavelength allocation is studied. It i...
Ignacio de Miguel, Michael Düser, Polina Bayv...
ADHOC
2006
184views more  ADHOC 2006»
13 years 7 months ago
Wireless underground sensor networks: Research challenges
This work introduces the concept of a Wireless Underground Sensor Network (WUSN). WUSNs can be used to monitor a variety of conditions, such as soil properties for agricultural ap...
Ian F. Akyildiz, Erich P. Stuntebeck