Sciweavers

814 search results - page 94 / 163
» Optimal pairings
Sort
View
104
Voted
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 16 days ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
96
Voted
TCS
1998
15 years 12 days ago
Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
Peng-Jun Wan
115
Voted
NETWORKS
2007
15 years 7 days ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
NOMS
2010
IEEE
189views Communications» more  NOMS 2010»
14 years 11 months ago
Self-optimization for handover oscillation control in LTE
— In this paper we analyze the performance of a self optimizing algorithm for handover parameter control which adjusts the settings depending on the oscillations experienced betw...
Jose Alonso-Rubio
97
Voted
ICMCS
2009
IEEE
158views Multimedia» more  ICMCS 2009»
14 years 10 months ago
Accurate alignment of presentation slides with educational video
Spatio-temporal alignment of electronic slides with corresponding presentation video opens up a number of possibilities for making the instructional content more accessible and un...
Quanfu Fan, Kobus Barnard, Arnon Amir, Alon Efrat