Sciweavers

182 search results - page 14 / 37
» A Theory of Strict P-completeness
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
FASE
2009
Springer
14 years 2 months ago
Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
Frank Hermann, Hartmut Ehrig, Claudia Ermel
CSEE
2003
Springer
14 years 25 days ago
The Cross-Course Software Engineering Project at the NTNU: Four Years of Experience
Many software engineering courses include all-term projects to convey principles relating to large-scale multi-person development. But even such projects will easily be too small ...
Guttorm Sindre, Tor Stålhane, Gunnar Brataas...
TPHOL
2002
IEEE
14 years 15 days ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
TON
2002
81views more  TON 2002»
13 years 7 months ago
Robust rate control for integrated services packet networks
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
Franco Blanchini, Renato Lo Cigno, Roberto Tempo