416 search results - page 21 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
128
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
115
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
118
click to vote
FLAIRS
2009
15 years 19 days ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
179
click to vote
Lab
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
122
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...