research seminar - complexity analysis of restricted pickup-and-delivery problems and a bayesian network model for document rank

dr. xing tan, a candidate for the orillia lta position in the department of computer science will present a seminar.

title: complexity analysis of restricted pickup-and-delivery problems and a bayesian network model for document ranking

abstract: the presentation introduces our recent research progress, and it contains two main parts. in part i, we perform complexity-theoretic and algorithmic analysis on computationally boundary cases of pickup-and-delivery problems and vehicle routing problems, that is, problems whose tasks are subject to precedence constraints or time-window constraints (pdpc, pdtw); and problems whose vehicles are subject to fuel-tank capacity constraints (greenpd). we have identified several, either strongly or weakly, np-hard problems, and additionally other ones that are polynomial-time solvable. in part ii, we demonstrate how one can address the classical document ranking problem in information retrieval, using a straightforward bayesian network model. effectiveness of the approach is empirically verified.

zoom link https://lakeheadu.zoom.us/j/94650647205?pwd=vduvdmfkothgn3povfhtk1nycno5... meeting id: 946 5064 7205 passcode: 8297