Sciweavers

438 search results - page 11 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
EOR
2006
125views more  EOR 2006»
13 years 7 months ago
A genetic algorithm for robotic assembly line balancing
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
Gregory Levitin, Jacob Rubinovitz, Boris Shnits
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 17 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
11 years 10 months ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
CVPR
2010
IEEE
14 years 4 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
MONET
2006
107views more  MONET 2006»
13 years 7 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao