Sciweavers

6740 search results - page 411 / 1348
» Using Classification as a Programming Language
Sort
View
JMLR
2012
13 years 6 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
ICFEM
2004
Springer
15 years 9 months ago
From Circus to JCSP
Circus is a combination of Z, CSP, and Morgan’s refinement calculus; it has an associated refinement strategy that supports the development of reactive programs. In this work, ...
Marcel Oliveira, Ana Cavalcanti
POPL
2009
ACM
15 years 10 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
IROS
2007
IEEE
112views Robotics» more  IROS 2007»
15 years 10 months ago
Orchestrating concurrency in robot swarms
— A functional approach to programming robot swarms brings with it well-defined properties that allow for automated concurrency and distributed execution. Further, the particula...
Anthony Cowley, Camillo J. Taylor
ECOOP
2008
Springer
15 years 5 months ago
ReCrash: Making Software Failures Reproducible by Preserving Object States
It is very hard to fix a software failure without being able to reproduce it. However, reproducing a failure is often difficult and time-consuming. This paper proposes a novel tech...
Shay Artzi, Sunghun Kim, Michael D. Ernst