Sciweavers

1016 search results - page 101 / 204
» Optimized algorithms for multi-agent routing
Sort
View
ISPD
1998
ACM
97views Hardware» more  ISPD 1998»
15 years 2 months ago
Device-level early floorplanning algorithms for RF circuits
—High-frequency circuits are notoriously difficult to lay out because of the tight coupling between device-level placement and wiring. Given that successful electrical performan...
Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley
FOCS
2006
IEEE
15 years 3 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
WONS
2005
IEEE
15 years 3 months ago
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
INFOCOM
2006
IEEE
15 years 3 months ago
An Optimal Dynamic Pricing Framework for Autonomous Mobile Ad Hoc Networks
— In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, ho...
Zhu Ji, Wei Yu, K. J. Ray Liu
DCOSS
2005
Springer
15 years 3 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie