Sciweavers

154 search results - page 5 / 31
» A Theory of Runtime Enforcement, with Results
Sort
View
TIC
1998
Springer
13 years 11 months ago
Polymorphic Equality - No Tags Required
Polymorphic equality is a controversial language construct. While being convenient for the programmer, it has been argued that polymorphic equality (1) invites to violation of soft...
Martin Elsman
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 9 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
VLSID
2002
IEEE
120views VLSI» more  VLSID 2002»
14 years 7 months ago
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoi...
CASES
2006
ACM
14 years 1 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 1 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...