This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
In the last years the user information seeking process on the Web has shifted from document search to object search. Hence, the answers provided by Web search engines cannot consis...
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Sh...
A current research project at the University of Strathclyde is introduced which aims to better understand the role of distributed engineering design in industry and address presen...
Steven P. MacGregor, Avril I. Thomson, Neal P. Jus...