Sciweavers

1016 search results - page 132 / 204
» Optimized algorithms for multi-agent routing
Sort
View
GLOBECOM
2006
IEEE
15 years 3 months ago
Progressive Accumulative Routing in Wireless Networks
This paper considers a sensor network where relay nodes cooperate in order to minimize the total energy consumption for the unicast transmission of a message from a single source ...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
DAC
2008
ACM
15 years 10 months ago
Path smoothing via discrete optimization
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
Michael D. Moffitt, David A. Papa, Zhuo Li, Charle...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
CCGRID
2008
IEEE
15 years 4 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
TON
2010
147views more  TON 2010»
14 years 8 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