|
|
|
Saeed A. Astaneh, Shahram Shah Heydari, Sara Taghavi Motlagh and Alireza Izaddoost
We consider the problem of SDN flow optimization in the presence of a dynamic probabilistic link failures model. We introduce a metric for path risk, which can change dynamically as network conditions and failure probabilities change. As these probabilit...
ver más
|
|
|
|
|
|
|
Kun An, Siyang Xie, Yanfeng Ouyang
Pág. 228 - 245
Object positioning and surveillance has been playing an important role in various indoor location-aware applications. Signal attenuation or blockage often requires multiple local sensors to be used jointly to provide coverage and determine object locatio...
ver más
|
|
|
|
|
|
|
Jiangtao Liu, Jee Eun Kang, Xuesong Zhou, Ram Pendyala
Pág. 827 - 847
The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering...
ver más
|
|
|
|
|
|
|
Tadahiro Taniguchi, Koki Kawasaki, Yoshiro Fukui, Tomohiro Takata and Shiro Yano
A linear function submission-based double auction (LFS-DA) mechanism for a regional electricity network is proposed in this paper. Each agent in the network is equipped with a battery and a generator. Each agent simultaneously becomes a producer and cons...
ver más
|
|
|
|
|
|
|
Rakesh Kawatra
In this paper we present a new heuristic procedure to solve the degree constrained minimal spanning tree problem. This procedure uses Lagrangian relaxation of the integer programming formulation of the problem to get a lower bound for the optimal objecti...
ver más
|
|
|
|
|
|
|
Huseyin Topaloglu
Pág. 637 - 649
|
|
|
|
|
|
|
Hwang, T.-K. Chang, S.-C.
Pág. 566 - 578
|
|
|
|
|
|
|
Zhang, Y; Luh, P B; Narimatsu, K; Moriya, T; Shimada, T; Fang, L
Pág. 70 - 79
|
|
|
|
|
|
|
Luh, P B; Zhao, X; Wang, Y; Thakur, L S
Pág. 78 - 88
|
|
|
|
|
|
|
Bakirtzis, A G; Zoumas, C E
Pág. 131 - 131
|
|
|
|