Sciweavers

2978 search results - page 131 / 596
» Operations Research
Sort
View
ORL
2010
158views more  ORL 2010»
14 years 10 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
123
Voted
ORL
2010
156views more  ORL 2010»
14 years 10 months ago
Advertisement allocation for generalized second-pricing schemes
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, A...
101
Voted
SCHEDULING
2010
57views more  SCHEDULING 2010»
14 years 10 months ago
Scheduling technicians and tasks in a telecommunications company
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunicatio...
Jean-François Cordeau, Gilbert Laporte, Fed...
223
Voted
CPHYSICS
2011
279views Education» more  CPHYSICS 2011»
14 years 7 months ago
CAMORRA: A C++ library for recursive computation of particle scattering amplitudes
We present a new Monte Carlo tool that computes full tree-level matrix elements in high-energy physics. The program accepts user-defined models and has no restrictions on the pro...
R. Kleiss, G. van den Oord
125
Voted
WWW
2008
ACM
16 years 4 months ago
Extraction and mining of an academic social network
This paper addresses several key issues in extraction and mining of an academic social network: 1) extraction of a researcher social network from the existing Web; 2) integration ...
Jie Tang, Jing Zhang, Limin Yao, Juan-Zi Li