— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
Background: Benchmarking algorithms in structural bioinformatics often involves the construction of datasets of proteins with given sequence and structural properties. The SCOP da...
James A. Casbon, Gavin E. Crooks, Mansoor A. S. Sa...
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...