Sciweavers

1927 search results - page 324 / 386
» UMDAs for dynamic optimization problems
Sort
View
109
Voted
ICNP
2005
IEEE
15 years 6 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
114
Voted
ATAL
2004
Springer
15 years 6 months ago
A Pheromone-Based Utility Model for Collaborative Foraging
Multi-agent research often borrows from biology, where remarkable examples of collective intelligence may be found. One interesting example is ant colonies’ use of pheromones as...
Liviu Panait, Sean Luke
94
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Measuring Bottleneck Bandwidth of Targeted Path Segments
Abstract— Accurate measurement of network bandwidth is crucial for network management applications as well as flexible Internet applications and protocols which actively manage ...
Khaled Harfoush, Azer Bestavros, John W. Byers
102
Voted
DAC
1997
ACM
15 years 4 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
DAC
2010
ACM
15 years 4 months ago
Eyecharts: constructive benchmarking of gate sizing heuristics
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
Puneet Gupta, Andrew B. Kahng, Amarnath Kasibhatla...