Sciweavers

5180 search results - page 56 / 1036
» Concurrency, Time, and Constraints
Sort
View
CSR
2007
Springer
15 years 6 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ESOP
2004
Springer
15 years 5 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
VLSI
2010
Springer
14 years 6 months ago
SESAM extension for fast MPSoC architectural exploration and dynamic streaming applications
Future systems will have to support multiple and concurrent dynamic compute-intensive applications, while respecting real-time and energy consumption constraints. To overcome these...
Nicolas Ventroux, Tanguy Sassolas, Raphael David, ...
DEXAW
2008
IEEE
129views Database» more  DEXAW 2008»
15 years 6 months ago
SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
Zhaowen Xing, Le Gruenwald, K. K. Phang