Sciweavers

7133 search results - page 127 / 1427
» Communication algorithms with advice
Sort
View
DAC
2008
ACM
16 years 5 months ago
ADAM: run-time agent-based distributed application mapping for on-chip communication
Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive s...
Jörg Henkel, Mohammad Abdullah Al Faruque, Ru...
MOBIHOC
2007
ACM
16 years 4 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
ITNG
2008
IEEE
15 years 11 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 10 months ago
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
ICN
2005
Springer
15 years 10 months ago
An Energy Constrained Multi-hop Clustering Algorithm for Wireless Sensor Networks
A wireless sensor network is a new kind of wireless Ad-Hoc network consisting of a large number of small low cost, power constrained sensors deployed in a large area for gathering...
Navin Kumar Sharma, Mukesh Kumar