952 search results - page 79 / 191 » Computational complexity of stochastic programming problems |
178
Voted
MABS
2005
Springer
15 years 11 months ago
2005
Springer
Currently there is a diversity of tools for agent-based simulation, which can be applied to the understanding of social phenomena. Describing this kind of phenomena with a visual l...
171
Voted
COREGRID
2007
Springer
16 years 10 days ago
2007
Springer
This paper deals with one of the fundamental properties of grid computing – transferring code between grid nodes and executing it remotely on heterogeneous hosts. Contemporary mi...
144
Voted
MFCS
2009
Springer
16 years 21 days ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
142
click to vote
JMLR
2010
15 years 28 days ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
140
Voted
ATAL
2007
Springer
16 years 10 days ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...