Sciweavers

19130 search results - page 154 / 3826
» Modelling multi-path problems
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
DAM
2010
79views more  DAM 2010»
15 years 6 months ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...
DAM
2006
116views more  DAM 2006»
15 years 6 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
JSW
2008
99views more  JSW 2008»
15 years 6 months ago
Using Data Mining in MURA Graphic Problems
The MURA phenomenon will result lots of problems in Photomask and TFT-LCD industries as well. In this paper, we designed and developed a MURA related association rules which suitab...
Wen-Hsing Kao, Jason C. Hung, Victoria Hsu
TSMC
2008
81views more  TSMC 2008»
15 years 6 months ago
Role Transfer Problems and Algorithms
Role transfer is a usual activity in an organization, especially in a crisis situation. Role assignment and transfer regulations are important to accomplish it. This paper discusse...
Haibin Zhu, MengChu Zhou