Sciweavers

5180 search results - page 157 / 1036
» Concurrency, Time, and Constraints
Sort
View
CASCON
1996
125views Education» more  CASCON 1996»
15 years 7 months ago
A memory-adaptive sort (MASORT) for database systems
A memory-adaptive sort is able to dynamically change the amount of memory used during sorting. The method described in this paper adjusts memory usage according to input size and ...
Weiye Zhang, Per-Åke Larson
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Separation Logic Semantics for Communicating Processes
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for sepa...
Tony Hoare, Peter W. O'Hearn
CP
2007
Springer
16 years 21 days ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
15 years 8 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
TKDE
2012
253views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Adding Temporal Constraints to XML Schema
—If past versions of XML documents are retained, what of the various integrity constraints defined in XML Schema on those documents? This paper describes how to interpret such c...
Faiz Currim, Sabah Currim, Curtis E. Dyreson, Rich...