A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
Fabio Porto, Eduardo Sany Laber, Patrick Valduriez
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual h...
We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separat...