Sciweavers

5055 search results - page 422 / 1011
» Relative Timing
Sort
View
EOR
2006
107views more  EOR 2006»
15 years 7 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...
IFIPTCS
2010
15 years 5 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
263
Voted
BMCBI
2010
218views more  BMCBI 2010»
15 years 5 months ago
A hybrid blob-slice model for accurate and efficient detection of fluorescence labeled nuclei in 3D
Background: To exploit the flood of data from advances in high throughput imaging of optically sectioned nuclei, image analysis methods need to correctly detect thousands of nucle...
Anthony Santella, Zhuo Du, Sonja Nowotschin, Anna-...
HICSS
2007
IEEE
110views Biometrics» more  HICSS 2007»
16 years 1 months ago
Paper versus Electronic: Challenges Associated with Physicians' Usage of Electronic Medical Records
This study builds on the theory of planned behavior, institutional and diffusion theories to investigate physicians’ attitudes and usage behaviors of electronic medical records ...
Virginia Ilie, James F. Courtney, Craig Van Slyke
EWSN
2006
Springer
16 years 7 months ago
FlexCup: A Flexible and Efficient Code Update Mechanism for Sensor Networks
Abstract. The ability to update the program code installed on wireless sensor nodes plays an import role in the highly dynamic environments sensor networks are often deployed in. S...
Andreas Lachenmann, Daniel Minder, Kurt Rothermel,...