76 search results - page 3 / 16 » On the Computational Complexity of Verifying One-Counter Pro... |
JUCS
2010
13 years 6 months ago
2010
: For many complex and dynamic ubiquitous services, context-aware cooperation can be a solution. However, the way is not yet clear to make individual objects cooperate with each ot...
CG
1999
Springer
13 years 7 months ago
1999
Springer
Business process re-engineering is becoming a main focus in today's efforts to overcome problems and deficits in the automotive and aerospace industries (e.g., integration in...
DNIS
2005
Springer
14 years 1 months ago
2005
Springer
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
IJCAI
2003
13 years 9 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...