Sciweavers

589 search results - page 10 / 118
» Introducing Dynamic Constraints in B
Sort
View
FOSSACS
2008
Springer
13 years 9 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
HIPEAC
2009
Springer
14 years 16 days ago
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
Mohammad Ansari, Mikel Luján, Christos Kots...
RTSS
2002
IEEE
14 years 25 days ago
Improving Quality-of-Control Using Flexible Timing Constraints: Metric and Scheduling Issues
Closed-loop control systems are dynamic systems subject to perturbations. One of the main concerns of the control is to design controllers to correct or limit the deviation that t...
Pau Martí, Josep M. Fuertes, Gerhard Fohler...
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 1 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
14 years 20 days ago
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria
— We consider generalized noncooperative Nash games with “shared constraints” in which there is a common constraint that players’ strategies are required to satisfy. We add...
Ankur A. Kulkarni, Uday V. Shanbhag