The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
Douglas Stott Parker Jr., Ruey-Lung Hsiao, Yi Xing...
We tackle the problem of real-time statistical analysis of functional magnetic resonance imaging (fMRI) data. In a recent paper, we proposed an incremental algorithm based on the e...
Alexis Roche, Philippe Pinel, Stanislas Dehaene, J...