We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...