Directory UMM :Data Elmu:jurnal:O:Operations Research Letters:Vol27.Issue4.2000:
Teks penuh
Dokumen terkait
In the sections to follow, we ®rst classify trac ¯ow into three kindsÐacceleration, deceleration and (strong) equilibrium, then analyze the phase plots for speed and occupancy
To test the proposition that the predictive performance of NN models is improved by reducing the number of hidden nodes, various neural networks with one to three hidden nodes
The problem of placing m web proxies in a linear net topology with n nodes so as to minimize the overall accessing latency in (1) can be solved in.. O( nm
We consider a problem of scheduling jobs in two-machine no-wait ow shops for which the objective is to minimize the makespan. Each job, upon completion of its processing on the
The third shows that there exists a linear-time algorithm for constructing the geometric solution to the 2SNPP given the topological solution, and we outline a rudimentary
We show that if cheap talk is meaningful (in the sense that babbling equilibria are ruled out) and if there is room for cooperation (namely if there exists at least one
Although the yields of grass and maize were on average lower than those on current farms, average farm yield is almost equal, because of a higher proportion of fodder beets and maize
Donato and Lazerson point out that despite a tremen- dous growth in the educational history of communities of color, there is “almost no synthesis or intersection across
