43 search results - page 3 / 9 » Extending a Concurrent Constraint Language by Propagators |
113
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
125
Voted
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
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...
112
Voted
POPL
1995
ACM
15 years 5 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
118
Voted
ASIAN
2004
Springer
15 years 7 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
125
click to vote
PPDP
1999
Springer
15 years 6 months ago
1999
Springer
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...