Sciweavers

40 search results - page 6 / 8
» Combinatory Formulations of Concurrent Languages
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
14 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 2 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
93
Voted
APLAS
2007
ACM
15 years 1 months ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
AAAI
2006
14 years 11 months ago
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
In recent years there has been a great deal of interest in "modular reinforcement learning" (MRL). Typically, problems are decomposed into concurrent subgoals, allowing ...
Sooraj Bhat, Charles Lee Isbell Jr., Michael Matea...
ERLANG
2006
ACM
15 years 3 months ago
Model checking erlang programs: the functional approach
We present the new model checker McErlang for verifying Erlang programs. In comparison with the etomcrl tool set, McErlang differs mainly in that it is implemented in Erlang. The ...
Lars-Åke Fredlund, Clara Benac Earle