We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin,...
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
A fast design variation technique for mechanical systems is presented. It is used to interactively optimize mechanical characteristics while "self-assembling" or satisfy...
Abstract Understanding potential genetic factors in disease or development of personalised e-Health solutions require scientists to access a multitude of data and compute resources...
Richard O. Sinnott, Oluwafemi Ajayi, Jipu Jiang, A...
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...