Sciweavers

114
Voted
AC
2002
Springer
15 years 16 days ago
Embedded Software
nce of computation has systematically abstracted away the physical world. Embedded software systems, however, engage the physical world. Time, concurrency, liveness, robustness, c...
Edward A. Lee
79
Voted
TSP
2008
116views more  TSP 2008»
15 years 16 days ago
Computation of Delay-Free Nonlinear Digital Filter Networks: Application to Chaotic Circuits and Intracellular Signal Transducti
Abstract--A method for the computation of nonlinear digital filter networks containing delay-free loops is proposed. By preserving the topology of the network this method permits t...
Federico Fontana, Federico Avanzini
79
Voted
TPDS
2008
89views more  TPDS 2008»
15 years 16 days ago
Algorithm-Based Fault Tolerance for Fail-Stop Failures
Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging. In this paper, we show that fail-stop process failures in ScaLAPACK matrix ...
Zizhong Chen, Jack Dongarra
105
Voted
TMC
2008
127views more  TMC 2008»
15 years 16 days ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
110
Voted
TCS
2008
15 years 17 days ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
79
Voted
SYNTHESE
2008
69views more  SYNTHESE 2008»
15 years 17 days ago
Dispositional implementation solves the superfluous structure problem
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...
Colin Klein
SIGOPS
2008
123views more  SIGOPS 2008»
15 years 17 days ago
Comparative evaluation of overlap strategies with study of I/O overlap in MPI-IO
Many scientific applications use parallel I/O to meet the low latency and high bandwidth I/O requirement. Among many available parallel I/O operations, collective I/O is one of th...
Christina M. Patrick, Seung Woo Son, Mahmut T. Kan...
NC
2008
122views Neural Networks» more  NC 2008»
15 years 18 days ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
112
Voted
LISP
2008
96views more  LISP 2008»
15 years 18 days ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
95
Voted
CORR
2007
Springer
123views Education» more  CORR 2007»
15 years 19 days ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath