1095 search results - page 38 / 219 » Preprocessing of Intractable Problems |
CP
2004
Springer
14 years 1 months ago
2004
Springer
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
IDA
2003
Springer
14 years 28 days ago
2003
Springer
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
DEDS
2010
13 years 7 months ago
2010
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...