Sciweavers

1204 search results - page 202 / 241
» Parallel concurrent ML
Sort
View
117
Voted
PPDP
2007
Springer
15 years 9 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
LICS
2006
IEEE
15 years 9 months ago
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. ...
HPCC
2005
Springer
15 years 8 months ago
Reducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
Marcelo Lobosco, Orlando Loques, Claudio Luis de A...
141
Voted
AGENTS
1998
Springer
15 years 7 months ago
A Hybrid Procedural/Deductive Executive for Autonomous Spacecraft
The New Millennium Remote Agent NMRA will be the rst AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic reco...
Barney Pell, Edward B. Gamble, Erann Gat, Ron Kees...
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 3 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon