Sciweavers

1242 search results - page 40 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
BMCBI
2007
98views more  BMCBI 2007»
13 years 7 months ago
Duration learning for analysis of nanopore ionic current blockades
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties, with potential implications ...
Alexander G. Churbanov, Carl Baribault, Stephen Wi...
KI
2009
Springer
14 years 1 months ago
Planning with h +  in Theory and Practice
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
Christoph Betz, Malte Helmert
CIE
2010
Springer
13 years 7 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SPAA
2003
ACM
14 years 19 days ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...