Sciweavers

1197 search results - page 100 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 6 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
IPPS
2006
IEEE
14 years 2 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
14 years 1 months ago
SDP for multi-criterion QMF bank design
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
H. D. Tuan, L. H. Nam, H. Tuy, T. Q. Nguyen
IMCSIT
2010
13 years 6 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
14 years 14 days ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...