Sciweavers

1840 search results - page 29 / 368
» time 2002
Sort
View
EOR
2002
79views more  EOR 2002»
13 years 7 months ago
Fast fully polynomial approximation schemes for minimizing completion time variance
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...
MANSCI
2008
96views more  MANSCI 2008»
13 years 7 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
CHI
2002
ACM
14 years 8 months ago
Social net: using patterns of physical proximity over time to infer shared interests
We describe Social Net, a novel interest-matching application that uses patterns of collocation, over time, to infer shared interests between users. Social Net demonstrates new po...
Michael A. Terry, Elizabeth D. Mynatt, Kathy Ryall...
ISORC
2002
IEEE
14 years 19 days ago
A Framework for Integrating the Real-Time Specification for Java and Java's Remote Method Invocation
This paper proposes a framework for integrating the Real-Time Specification for Java and Java's Remote Method Invocation. The concepts of real-time remote and distributed rea...
Andy J. Wellings, Roy Clark, E. Douglas Jensen, Do...
ORL
2002
78views more  ORL 2002»
13 years 7 months ago
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for...
Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae