Sciweavers

2323 search results - page 64 / 465
» Power optimization for connectivity problems
Sort
View
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
14 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
GECCO
2008
Springer
324views Optimization» more  GECCO 2008»
13 years 10 months ago
Convergence behavior of the fully informed particle swarm optimization algorithm
The fully informed particle swarm optimization algorithm (FIPS) is very sensitive to changes in the population topology. The velocity update rule used in FIPS considers all the ne...
Marco Antonio Montes de Oca, Thomas Stützle
ORL
2006
103views more  ORL 2006»
13 years 9 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
SIGOPSE
2004
ACM
14 years 3 months ago
Open problems in data collection networks
Research in sensor networks, continuous queries (CQ), and other domains has been motivated by powerful applications that aim to aggregate, assimilate, and interact with scores of ...
Jonathan Ledlie, Jeffrey Shneidman, Matt Welsh, Me...
DCOSS
2006
Springer
14 years 1 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei