This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
Robert S. Gray, David Kotz, Calvin C. Newport, Nik...
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr