Sciweavers

5180 search results - page 197 / 1036
» Concurrency, Time, and Constraints
Sort
View
PEPM
1994
ACM
15 years 10 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder
COORDINATION
2010
Springer
15 years 10 months ago
Compositional Construction of Real-Time Dataflow Networks
Increasing sizes of present-day distributed software systems call for coordination models which are both modular and scalable. Precise modelling of real-life applications further r...
Stephanie Kemper
SAC
2009
ACM
16 years 1 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck
EUROMICRO
2000
IEEE
15 years 11 months ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 10 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis