Yuri
Bizzoni,
Stefania
Degaetano-Ortlieb,
Katrin
Menzel,
Elke
Teich.
Proceedings
of
the
5th
Joint
SIGHUM
Workshop
on
Computational
Linguistics
for
Cultural
Heritage,
Social
Sciences,
Humanities
and
Literature.
2021.
2018 Winter Simulation Conference (WSC),
Год журнала:
2021,
Номер
47, С. 1 - 12
Опубликована: Дек. 12, 2021
Data
centers
have
become
a
large
part
of
our
world
and
infrastructure
now
many
them
want
to
provided
information
their
customers
about
the
response
times
jobs.
To
this
end,
it
is
important
be
able
predict
what
jobs
might
when
data
center
implements
specific
queueing
discipline.
In
paper,
we
investigate
feasibility
reliably
predicting
in
real
time
single
server
shortest
remaining
processing
queue
or
G/G/1/SRPT
queue.
Our
proposed
prediction
methodology
combine
stochastic
simulation
with
supervised
learning
machine
algorithms.
We
consider
several
forms
state
like
job
size
number
other
system
at
arrival.
hope
that
can
replicated
for
purposes
systems.
2018 Winter Simulation Conference (WSC),
Год журнала:
2023,
Номер
unknown, С. 2813 - 2824
Опубликована: Дек. 10, 2023
Bail
funds
have
a
long
history
of
helping
those
who
cannot
afford
bail
in
order
to
wait
for
trial
at
home.
They
also
had
large
impact
on
the
verdict
defendant.
In
this
paper,
first
stochastic
model
capturing
dynamics
community
fund
is
presented.
The
integrates
traditional
queueing
models
with
classic
insurance/risk
represent
fund's
intricate
dynamics.
Since
blocking
does
not
closed-form
expressions
its
moments,
simulation
used
assess
Gaussian-based
approximations
that
estimate
probability
defendant
being
denied
access
when
it
lacks
adequate
support
them.
Additionally,
new
simulation-based
algorithm
proposed
and
uses
deterministic
infusion
capital
as
control
variable
stabilize
defendants
fund.
Our
results
reveal
our
are
suitable
moderately
highly
active
funds.
SSRN Electronic Journal,
Год журнала:
2020,
Номер
unknown
Опубликована: Янв. 1, 2020
Service
system
design
is
often
informed
by
queueing
theory.
Traditional
theory
assumes
that
servers
work
at
constant
speeds.
That
reasonable
in
computer
science
and
manufacturing
contexts.
However,
service
systems
are
people,
and,
contrast
to
machines,
systemic
incentives
created
decisions
influence
their
We
study
how
server
speed
affected
managerial
concerning
(i)
many
staff
much
pay
them,
(ii)
whether
when
turn
away
customers,
the
context
of
many-server
queues
with
finite
or
infinite
buffers
(M/M/N/k
k
∈
Z+∪{∞})
which
speeds
emerge
as
solution
a
noncooperative
game.We
show
symmetric
equilibrium
always
exists
loss
(N=k)
provide
conditions
for
existence
single-server
(N=1).
For
general
M/M/N/k
system,
we
sufficient
condition
first-order
bounds
on
such
solution;
however,
showing
it
an
challenging
due
multiple
local
maxima
utility
function.
Nevertheless,
asymptotic
regime
demand
becomes
large,
function
concave,
allowing
us
characterize
underloaded,
critically
loaded,
overloaded
equilibria.
Yuri
Bizzoni,
Stefania
Degaetano-Ortlieb,
Katrin
Menzel,
Elke
Teich.
Proceedings
of
the
5th
Joint
SIGHUM
Workshop
on
Computational
Linguistics
for
Cultural
Heritage,
Social
Sciences,
Humanities
and
Literature.
2021.