Sciweavers

256 search results - page 36 / 52
» Separation of NP-Completeness Notions
Sort
View
IANDC
2008
112views more  IANDC 2008»
14 years 12 months ago
Inclusion dynamics hybrid automata
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
Alberto Casagrande, Carla Piazza, Alberto Policrit...
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 12 months ago
On Universally Decodable Matrices for Space-Time Coding
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
Pascal O. Vontobel, Ashwin Ganesan
FUIN
2006
96views more  FUIN 2006»
14 years 12 months ago
A Component Coordination Model Based on Mobile Channels
In this paper we present a coordination model for component-based software systems based on the notion of mobile channels, define it in terms of a compositional trace-based semanti...
Juan Guillen Scholten, Farhad Arbab, Frank S. de B...
IJFCS
2006
111views more  IJFCS 2006»
14 years 11 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
JAIR
2008
145views more  JAIR 2008»
14 years 11 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein