Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
Raphael M. Reischuk, Christian Schulte, Peter J. S...
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
Abstract. We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which ca...
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...