Sciweavers

1265 search results - page 151 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
MOBIHOC
2008
ACM
14 years 8 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
ICC
2007
IEEE
14 years 3 months ago
Mobile Direction Assisted Predictive Base Station Switching for Broadband Wireless Systems
— Many broadband wireless access (BWA) systems, such as IEEE 802.16e, support high-mobility users traveling at vehicular speeds. BWA systems capable of high data rates and low bi...
O. Can Ozdural, Huaping Liu
MSWIM
2009
ACM
14 years 3 months ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere
ICANN
2010
Springer
13 years 9 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel