Sciweavers

3422 search results - page 294 / 685
» Random Subset Optimization
Sort
View
MOBIHOC
2005
ACM
16 years 4 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
ISCI
2008
159views more  ISCI 2008»
15 years 5 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao
TWC
2008
135views more  TWC 2008»
15 years 4 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
TON
2010
147views more  TON 2010»
15 years 3 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
167
Voted
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
15 years 9 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim