Sciweavers

5180 search results - page 11 / 1036
» Concurrency, Time, and Constraints
Sort
View
CSCLP
2005
Springer
15 years 3 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
ICC
2009
IEEE
152views Communications» more  ICC 2009»
15 years 4 months ago
On Concurrent Multipath Transfer in SCTP-Based Handover Scenarios
Abstract—Handling mobility at the transport layer is a promising approach to achieve seamless handover in the context of heterogeneous wireless access networks. In particular, fe...
Lukasz Budzisz, Ramon Ferrús, Ferran Casade...
JFP
2000
91views more  JFP 2000»
14 years 9 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
TIME
1998
IEEE
15 years 1 months ago
Tackling the Qualification Problem using Fluent Dependency Constraints: Preliminary Report
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...
Patrick Doherty, Jonas Kvarnström
96
Voted
RTCSA
2003
IEEE
15 years 2 months ago
Towards Aspectual Component-Based Development of Real-Time Systems
Increasing complexity of real-time systems, and demands for enabling their configurability and tailorability are strong motivations for applying new software engineering principle...
Aleksandra Tesanovic, Dag Nyström, Jörge...