Sciweavers

1831 search results - page 36 / 367
» Time Constraints in Workflow Systems
Sort
View
140
Voted
ICLP
2003
Springer
15 years 8 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
111
Voted
TPLP
2010
102views more  TPLP 2010»
15 years 1 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
CP
2004
Springer
15 years 9 months ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
110
Voted
FORMATS
2006
Springer
15 years 7 months ago
Matching Scenarios with Timing Constraints
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
Prakash Chandrasekaran, Madhavan Mukund
126
Voted
DAC
1995
ACM
15 years 7 months ago
Rephasing: A Transformation Technique for the Manipulation of Timing Constraints
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
Miodrag Potkonjak, Mani B. Srivastava