Sciweavers

2056 search results - page 91 / 412
» time 2000
Sort
View
UAI
2000
15 years 5 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
SAJ
2000
129views more  SAJ 2000»
15 years 4 months ago
Conflict analysis as a means of enforcing static separation of duty requirements in workflow environments
The increasing reliance on information technology to support business processes has emphasised the need for information security mechanisms. This, however, has resulted in an ever...
Stephen Perelson, Reinhardt A. Botha
SRDS
2000
IEEE
15 years 8 months ago
Issues Insufficiently Resolved in Century 20 in the Fault-Tolerant Distributed Computing Field
: As Century 21 just opened up, it is a fitting time to reflect on the evolution of the fault-tolerant distributed computing technology that occurred in the last century. The autho...
K. H. Kim
HYBRID
2000
Springer
15 years 7 months ago
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
Peter Niebert, Sergio Yovine
ANSS
2000
IEEE
15 years 8 months ago
Specifying Truck Movement in Traffic Models Using Cell-DEVS
A specification language was defined to outline sections of cities as cell spaces. The goal is to allow the definition of complex traffic models in a simple fashion for the modele...
Alejandra Davidson, Gabriel A. Wainer