Sciweavers

11 search results - page 2 / 3
» Primal and dual neural networks for shortest-path routing
Sort
View
NETWORKS
2011
13 years 22 days ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
COMCOM
2008
153views more  COMCOM 2008»
13 years 5 months ago
Available bandwidth estimation and admission control for QoS routing in wireless mesh networks
This article presents an integrated admission control and routing mechanism for multi-rate wireless mesh networks. Admission control depends on precise estimates of available band...
Mesut Ali Ergin, Marco Gruteser, Lin Luo, Dipankar...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
13 years 10 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ICANN
2007
Springer
13 years 12 months ago
Sparse Least Squares Support Vector Regressors Trained in the Reduced Empirical Feature Space
Abstract. In this paper we discuss sparse least squares support vector regressors (sparse LS SVRs) defined in the reduced empirical feature space, which is a subspace of mapped tr...
Shigeo Abe, Kenta Onishi
BIOWIRE
2007
Springer
13 years 12 months ago
Coalition Games and Resource Allocation in Ad-Hoc Networks
In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
Richard J. Gibbens, Peter B. Key