Sciweavers

833 search results - page 56 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
14 years 1 months ago
Reducing Fitness Evaluations Using Clustering Techniques and Neural Network Ensembles
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...
Yaochu Jin, Bernhard Sendhoff
GLOBECOM
2009
IEEE
13 years 11 months ago
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...
Dejun Yang, Xi Fang, Nan Li, Guoliang Xue
CCR
2006
122views more  CCR 2006»
13 years 7 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
TSP
2008
89views more  TSP 2008»
13 years 7 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
Duong A. Hoang, Ronald A. Iltis