492 search results - page 85 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
123
click to vote
HPCA
2005
IEEE
15 years 11 months ago
2005
IEEE
Hardware transactional memory should support unbounded transactions: transactions of arbitrary size and duration. We describe a hardware implementation of unbounded transactional ...
103
click to vote
VSTTE
2005
Springer
15 years 4 months ago
2005
Springer
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
97
Voted
ICTAC
2005
Springer
15 years 4 months ago
2005
Springer
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the ...