Sciweavers

952 search results - page 95 / 191
» Computational complexity of stochastic programming problems
Sort
View
143
Voted
CCGRID
2006
IEEE
15 years 6 months ago
DIMVisual: Data Integration Model for Visualization of Parallel Programs Behavior
Abstract-- The development of high performance parallel applications for clusters is considered a complex task. This can happen because the influence of the execution environment a...
Lucas Mello Schnorr, Philippe Olivier Alexandre Na...
CP
2005
Springer
15 years 8 months ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
JAIR
2006
101views more  JAIR 2006»
15 years 2 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee
JAIR
2000
152views more  JAIR 2000»
15 years 2 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
SAC
2008
ACM
15 years 2 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...