Sciweavers

1734 search results - page 170 / 347
» MSDR-D Network Localization Algorithm
Sort
View
JNW
2006
118views more  JNW 2006»
13 years 10 months ago
UMTS Capacity and Throughput Maximization for Different Spreading Factors
An analytical model for calculating capacity in multi-cell UMTS networks is presented. Capacity is maximized for different spreading factors and for perfect and imperfect power con...
Robert Akl, Son Nguyen
FLAIRS
2001
14 years 5 days ago
Structural Learning in Object Oriented Domains
When constructing a Bayesian network, it can be advantageous to employ structural learning algorithms to combine knowledge captured in databases with prior information provided by...
Olav Bangsø, Helge Langseth, Thomas D. Niel...
TEC
2010
203views more  TEC 2010»
13 years 5 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
MOBIHOC
2006
ACM
14 years 10 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
INFOCOM
2009
IEEE
14 years 5 months ago
Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
Lei Ying, Sanjay Shakkottai