Sciweavers

475 search results - page 31 / 95
» Reasoning About the Transfer of Control
Sort
View
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
14 years 10 months ago
Simple, Robust and Highly Concurrent B-trees with Node Deletion
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
David B. Lomet
TON
2008
138views more  TON 2008»
13 years 8 months ago
On the performance benefits of multihoming route control
Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks tod...
Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, ...
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 3 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
AI50
2006
14 years 15 days ago
Dynamical Systems in the Sensorimotor Loop: On the Interrelation Between Internal and External Mechanisms of Evolved Robot Behav
This case study demonstrates how the synthesis and the analysis of minimal recurrent neural robot control provide insights into the exploration of embodiment. By using structural e...
Martin Hülse, Steffen Wischmann, Poramate Man...
SASO
2010
IEEE
13 years 6 months ago
Self-Adaptive Resource Allocation in Open Distributed Systems
In an open distributed system, computational resources are peer-owned, and distributed over time and space. The fact that these resources can dynamically join or leave the system (...
Xinghui Zhao, Nadeem Jamali