Sciweavers

1242 search results - page 77 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 6 months ago
Fast Monte Carlo Simulation Methods for Biological Reaction-Diffusion Systems in Solution and on Surfaces
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
Rex A. Kerr, Thomas M. Bartol, Boris Kaminsky, Mar...
SMI
2005
IEEE
15 years 11 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
IJCNN
2008
IEEE
16 years 13 days ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 6 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
RECOMB
2010
Springer
15 years 3 months ago
Ultra-Perfect Sorting Scenarios
Abstract. Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definitio...
Aïda Ouangraoua, Anne Bergeron, Krister M. Sw...