Sciweavers

5214 search results - page 371 / 1043
» The Online Specialization Problem
Sort
View
CCE
2004
15 years 6 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
CSCW
2002
ACM
15 years 6 months ago
Achieving undo in bitmap-based collaborative graphics editing systems
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
Xueyi Wang, Jiajun Bu, Chun Chen
162
Voted
IJRR
2002
85views more  IJRR 2002»
15 years 6 months ago
On Motion Planning for Robotic Manipulation with Permanent Rolling Contacts
We address the motion planning problem (open-loop trajectory design) for manipulating rigid bodies with permanent rolling contact without slipping. This problem is related in part...
Bálint Kiss, Jean Lévine, Bél...
DISOPT
2008
89views more  DISOPT 2008»
15 years 6 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
197
Voted
TALG
2010
109views more  TALG 2010»
15 years 5 months ago
Facility location with hierarchical facility costs
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
Zoya Svitkina, Éva Tardos