Sciweavers

2092 search results - page 344 / 419
» A Theory of Non-Deterministic Networks
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 4 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 3 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
EMSOFT
2006
Springer
15 years 3 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
FLAIRS
2008
15 years 1 months ago
A First-Order Bayesian Tool for Probabilistic Ontologies
One of the major weaknesses of current research on the Semantic Web (SW) is the lack of proper means to represent and reason with uncertainty. A number of recent efforts from the ...
Paulo Cesar G. da Costa, Marcelo Ladeira, Rommel N...
CCS
2008
ACM
15 years 1 months ago
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...
Alessandro Armando, Roberto Carbone, Luca Compagna...