Sciweavers

2343 search results - page 332 / 469
» The Locomotive Routing Problem
Sort
View
172
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding
—Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called netwo...
Tingting Chen, Sheng Zhong
IFIPTCS
2010
15 years 3 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
DAC
2008
ACM
16 years 6 months ago
Enhancing timing-driven FPGA placement for pipelined netlists
FPGA application developers often attempt to use pipelining, Cslowing and retiming to improve the performance of their designs. Unfortunately, such registered netlists present a f...
Kenneth Eguro, Scott Hauck
DAC
2005
ACM
16 years 6 months ago
Architecture-adaptive range limit windowing for simulated annealing FPGA placement
Previous research has shown both theoretically and practically that simulated annealing can greatly benefit from the incorporation of an adaptive range limiting window to control ...
Kenneth Eguro, Scott Hauck, Akshay Sharma
EWSN
2009
Springer
16 years 5 months ago
QoS Management for Wireless Sensor Networks with a Mobile Sink
The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level ...
Rob Hoes, Twan Basten, Wai-Leong Yeow, Chen-Khong ...