Sciweavers

11371 search results - page 116 / 2275
» The network inhibition problem
Sort
View
QSHINE
2005
IEEE
16 years 1 days ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
ICN
2005
Springer
15 years 12 months ago
Primary/Secondary Path Generation Problem: Reformulation, Solutions and Comparisons
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
Quanshi Xia, Helmut Simonis
ITRUST
2005
Springer
15 years 12 months ago
Alleviating the Sparsity Problem of Collaborative Filtering Using Trust Inferences
Collaborative Filtering (CF), the prevalent recommendation approach, has been successfully used to identify users that can be characterized as “similar” according to their logg...
Manos Papagelis, Dimitris Plexousakis, Themistokli...
HM
2009
Springer
165views Optimization» more  HM 2009»
15 years 11 months ago
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
Jakob Walla, Mario Ruthmair, Günther R. Raidl
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos