Sciweavers

1578 search results - page 148 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
IAT
2005
IEEE
14 years 2 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
IJCNN
2007
IEEE
14 years 3 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
VTC
2007
IEEE
119views Communications» more  VTC 2007»
14 years 3 months ago
Adaptive Resource Allocation in Cellular OFDMA System with Multiple Relay Stations
— We address the problem of radio resource allocation in the Downlink (DL) of a cellular system with Relay Stations (RS), based on Orthogonal Frequency Division Multiple Access (...
Megumi Kaneko, Petar Popovski
INFOCOM
2006
IEEE
14 years 3 months ago
An Optimal Dynamic Pricing Framework for Autonomous Mobile Ad Hoc Networks
— In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, ho...
Zhu Ji, Wei Yu, K. J. Ray Liu
NIPS
2008
13 years 10 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr