The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an ...
Paulo J. Matos, Jordi Planes, Florian Letombe, Jo&...
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
Universities need to respond to a change in the mix of student profiles from a majority of the traditional academically committed student to a majority of the students who seek a ...
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
Benjamin Taskar, Ming Fai Wong, Pieter Abbeel, Dap...