1984 search results - page 177 / 397 » The colourful feasibility problem |
160
click to vote
AIPS
2007
15 years 8 months ago
2007
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
177
click to vote
AIPS
2008
15 years 8 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
161
click to vote
ALGOSENSORS
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
171
click to vote
ATMOS
2007
15 years 8 months ago
2007
This paper addresses the problem of generating conflict-free periodic train timetables for large railway networks. We follow a two level approach, where a simplified track topolo...
165
click to vote
AAAI
1998
15 years 7 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...