Sciweavers

909 search results - page 76 / 182
» On the approximability of some network design problems
Sort
View
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 11 days ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
DAC
2006
ACM
16 years 7 months ago
Optimality study of resource binding with multi-Vdds
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
Deming Chen, Jason Cong, Yiping Fan, Junjuan Xu
IJCNN
2000
IEEE
15 years 10 months ago
Incorporating a priori Knowledge into Initialized Weights for Neural Classifier
Artificial neural networks (ANN), esp. multilayer perceptrons (MLP) have been widely used in pattern recognition and classification. Nevertheless, how to incorporate a priori know...
Zhe Chen, Tian-Jin Feng, Zweitze Houkes
ISCC
2007
IEEE
16 years 15 days ago
Long Horizon End-to-End Delay Forecasts: A Multi-Step-Ahead Hybrid Approach
A long horizon end-to-end delay forecast, if possible, will be a breakthrough in traffic engineering. This paper introduces a hybrid approach to forecast end-to-end delays using ...
Vinh Bui, Weiping Zhu, Antonio Pescapè, Ale...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau