Sciweavers

4839 search results - page 137 / 968
» A survey of computational complexity results in systems and ...
Sort
View
TCS
2011
14 years 8 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
IROS
2007
IEEE
172views Robotics» more  IROS 2007»
15 years 8 months ago
Motor control optimization of compliant one-legged locomotion in rough terrain
— While underactuated robotic systems are capable of energy efficient and rapid dynamic behavior, we still do not fully understand how body dynamics can be actively used for ada...
Fumiya Iida, Russ Tedrake
DAC
2006
ACM
15 years 7 months ago
High-performance operating system controlled memory compression
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed ...
Lei Yang, Haris Lekatsas, Robert P. Dick
ICDCSW
2005
IEEE
15 years 7 months ago
Specifying Information-Flow Controls
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
Howard Chivers, Jeremy Jacob
CCS
2007
ACM
15 years 5 months ago
Efficient policy analysis for administrative role based access control
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...