Sciweavers

PPL
2007
112views more  PPL 2007»
13 years 4 months ago
Embodied Computation
The traditional computational devices and models, such as the von Neumann architecture or the Turing machine, are strongly influenced by concepts of central control and perfectio...
Heiko Hamann, Heinz Wörn
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
13 years 4 months ago
CX: A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks...
Peter R. Cappello, Dimitros Mourloukos
JCB
1998
129views more  JCB 1998»
13 years 4 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
EC
1998
112views ECommerce» more  EC 1998»
13 years 4 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 4 months ago
Robust Plane Sweep for Intersecting Segments
In this paper, we reexamine in the framework of robust computation the Bentley
Jean-Daniel Boissonnat, Franco P. Preparata
FMSD
2002
81views more  FMSD 2002»
13 years 4 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann
MST
2000
101views more  MST 2000»
13 years 4 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
FUIN
2000
68views more  FUIN 2000»
13 years 4 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
CORR
2002
Springer
96views Education» more  CORR 2002»
13 years 4 months ago
A computer scientist looks at game theory
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with fai...
Joseph Y. Halpern
LOGCOM
2007
59views more  LOGCOM 2007»
13 years 4 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard