2109 search results - page 258 / 422 » Solving Necklace Constraint Problems |
136
Voted
UAI
1998
15 years 6 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
132
Voted
SCHEDULING
2008
15 years 4 months ago
2008
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...
157
click to vote
PPDP
2010
Springer
15 years 3 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
131
Voted
ASYNC
1998
IEEE
15 years 9 months ago
1998
IEEE
None of the available minimizers for exact 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to heuristic...
155
click to vote
AAAI
2010
15 years 6 months ago
2010
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...