Sciweavers

175 search results - page 30 / 35
» Approximation Algorithms for Flexible Job Shop Problems
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
CVPR
2010
IEEE
13 years 9 months ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...
COR
2007
80views more  COR 2007»
13 years 7 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
EOR
2007
117views more  EOR 2007»
13 years 7 months ago
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
Sinan Gurel, M. Selim Akturk
KDD
2012
ACM
166views Data Mining» more  KDD 2012»
11 years 10 months ago
Selecting a characteristic set of reviews
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
Theodoros Lappas, Mark Crovella, Evimaria Terzi