Sciweavers

3096 search results - page 609 / 620
» The Generalized FITC Approximation
Sort
View
EOR
2006
107views more  EOR 2006»
13 years 9 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
COMGEO
2007
ACM
13 years 9 months ago
Geometric spanners with applications in wireless networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
ISI
2008
Springer
13 years 9 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
COR
2007
80views more  COR 2007»
13 years 9 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
JCP
2008
116views more  JCP 2008»
13 years 9 months ago
Sensor Location Strategy in Large-Scale Systems for Fault Detection Applications
Fault detection in large-scale systems is conducted by the use of sensors, thus the sensor location influences the performances of fault detection directly. As the scale of systems...
Fan Yang, Deyun Xiao