Sciweavers

4234 search results - page 373 / 847
» Clustering in cooperative networks
Sort
View
MIDDLEWARE
2004
Springer
16 years 6 days ago
Kernel-middleware interaction to support adaptation in pervasive computing environments
In pervasive computing environments, conditions are highly variable and resources are limited. In order to meet the needs of applications, systems must adapt dynamically to changi...
Farshad A. Samimi, Philip K. McKinley, Seyed Masou...
199
Voted
JSAC
2007
115views more  JSAC 2007»
15 years 6 months ago
Energy aware power allocation strategies for multihop-cooperative transmission schemes
Abstract— This paper deals with a cooperative decoded relaying scheme in multihop wireless network and the corresponding transmitters power allocation strategies for nodes belong...
Stefano Savazzi, Umberto Spagnolini
CCGRID
2006
IEEE
16 years 28 days ago
INTCTD: A Peer-to-Peer Approach for Intrusion Detection
In this paper we propose a peer-to-peer (P2P) prototype (INTCTD) for intrusion detection over an overlay network. INTCTD is a distributed system based on neural networks for detec...
Catalin Dumitrescu
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
16 years 1 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 1 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl