dblp: Natural Computing, Volume 12 (original) (raw)



default search action
- combined dblp search
- author search
- venue search
- publication search
Authors:
- no matches

Venues:
- no matches

Publications:
- no matches



- > Home > Journals > Natural Computing
SPARQL queries 
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Volume 12, Number 1, March 2013
Part 1: Special Issue: Quantum communication / Part 2: Special Issue: Nature inspired solutions for high performance computing

Tal Mor, Alain Tapp:
Preface. 1-4

Netanel Aharon, Shai Machnes, Benni Reznik, Jonathan Silman, Lev Vaidman:
Continuous input nonlocal games. 5-8

Wim van Dam:
Implausible consequences of superstrong nonlocality. 9-12

Nicolas Gisin, Sandu Popescu
, Valerio Scarani
, Stefan Wolf
, Jürg Wullschleger:
Oblivious transfer and quantum channels as communication resources. 13-17

Pavel Trojek
, Christian Schmid, Mohamed Bourennane, Caslav Brukner, Marek Zukowski
, Harald Weinfurter
:
Experimental multipartner quantum communication complexity employing just one qubit. 19-26

Gianluigi Folino
, Carlo Mastroianni
, Sanaz Mostaghim
:
Preface: nature inspired solutions for high performance computing. 27-28

Ivan Kondov
:
Protein structure prediction using distributed parallel particle swarm optimization. 29-41

Jose Luis Fernandez-Marquez
, Giovanna Di Marzo Serugendo
, Sara Montagna
, Mirko Viroli
, Josep Lluís Arcos
:
Description and composition of bio-inspired design patterns: a complete overview. 43-67

Amos Brocco:
The grid, the load and the gradient - A bio-inspired approach to load balancing. 69-85

Benjamin Satzger, Oliver Kramer:
Goal distance estimation for automated planning using neural networks and support vector machines. 87-100

Majid Babaei:
A novel text and image encryption method based on chaos theory and DNA computing. 101-107

Ruochen Liu, Xiao Wang, Jing Liu, Lingfen Fang, Licheng Jiao
:
A preference multi-objective optimization based on adaptive rank clone and differential evolution. 109-132
Volume 12, Number 2, June 2013
Part 1: Special Issue: Distributed Evolutionary Computation in Informal Environments / Part 2: Special Issue: DNA Computing 17

K. Meri, Maribel García Arenas
, Antonio Miguel Mora
, Juan Julián Merelo Guervós
, Pedro A. Castillo
, Pablo García-Sánchez
, Juan Luis Jiménez Laredo
:
Cloud-based evolutionary algorithms: An algorithmic study. 135-147

Juan Julián Merelo Guervós
, Antonio Miguel Mora
, Carlos M. Fernandes
, Anna Isabel Esparcia-Alcázar:
Designing and testing a pool-based evolutionary algorithm. 149-162

Francisco Fernández de Vega, Gustavo Olague
, Leonardo Trujillo
, Daniel Lombraña Gonzalez:
Customizable execution environments for evolutionary computation using BOINC + virtualization. 163-177

Julián Domínguez, Enrique Alba
:
Dealing with hardware heterogeneity: a new parallel search model. 179-193

Diego J. Bodas-Sagi, Pablo Fernández-Blanco
, José Ignacio Hidalgo
, Francisco José Soltero-Domingo
:
A parallel evolutionary algorithm for technical market indicators optimization. 195-207

Luca Cardelli
, William M. Shih:
Preface. 209

Stavros Konstantinidis
, Nicolae Santean:
Computing maximal Kleene closures that are embeddable in a given subword-closed language. 211-222

Robert Brijder
, Joris J. M. Gillis, Jan Van den Bussche
:
Graph-theoretic formalization of hybridization in DNA sticker complexes. 223-234

Mark G. Arnold:
Improved DNA-sticker arithmetic: tube-encoded-carry, Logarithmic Number System and Monte-Carlo methods. 235-246

Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow:
One-dimensional staged self-assembly. 247-258

Oleg Semenov, Mark J. Olah, Darko Stefanovic:
Cooperative linear cargo transport with molecular spiders. 259-276

Maarten Houbraken, Sofie Demeyer
, Dimitri Staessens, Pieter Audenaert, Didier Colle, Mario Pickavet
:
Fault tolerant network design inspired by Physarum polycephalum. 277-289

Hector Zenil
:
Turing patterns with Turing machines: emergence and low-level structure formation. 291-303
Volume 12, Number 3, September 2013
Special Issue: Cellular Automata and Applications

Alberto Dennunzio, Enrico Formenti
:
Foreword: cellular automata and applications. 305

Michael Vielhaber
:
Computation of functions on n bits by asynchronous clocking of cellular automata. 307-322

Heather Betel, Pedro Paulo Balbi de Oliveira
, Paola Flocchini:
Solving the parity problem in one-dimensional cellular automata. 323-337

Murillo Guimarães Carneiro
, Gina M. B. Oliveira:
Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood. 339-351

Jean-Vivien Millo, Robert de Simone:
Explicit routing schemes for implementation of cellular automata on processor arrays. 353-368

Arto Salomaa:
Minimal and almost minimal reaction systems. 369-376

W. Richard Stark:
Amorphous computing: examples, mathematics and theory. 377-392

William M. Stevens:
Using transition systems to describe and predict the behaviour of structured excitable media. 393-410

Wesley Emeneker, Amy W. Apon:
On modeling contention for shared caches in multi-core processors with techniques from ecology. 411-428

Gabriel Ciobanu
:
General patterns of interaction in stochastic fusion. 429-439
Volume 12, Number 4, December 2013
Part 1: Special Issue: Frontiers of Natural Computing - Part 2: Special issue: Asynchronous cellular automata and applications

Michael A. Lones
, Andy M. Tyrrell, Susan Stepney, Leo S. D. Caves:
Special issue on the frontiers of natural computing. 441-442

Larry Bull:
Consideration of mobile DNA: new forms of artificial genetic regulatory networks. 443-452

Michael A. Lones
, Alexander P. Turner
, Luis A. Fuente, Susan Stepney
, Leo S. D. Caves, Andy M. Tyrrell:
Biochemical connectionism. 453-472

Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He
:
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning. 473-484

Ricard V. Solé
, Javier Macía:
Expanding the landscape of biological computation with synthetic multicellular consortia. 485-497

Germán Terrazas, Hector Zenil, Natalio Krasnogor
:
Exploring programmable self-assembly in non-DNA based molecular computing. 499-515

René Doursat, Hiroki Sayama
, Olivier Michel:
A review of morphogenetic engineering. 517-535

Alberto Dennunzio, Nazim Fatès
, Enrico Formenti
:
Foreword: asynchronous cellular automata and applications. 537-538

Thomas Worsch:
Towards intrinsically universal asynchronous CA. 539-550

Olivier Bouré, Nazim Fatès
, Vincent Chevrier
:
First steps on asynchronous lattice-gas models with an application to a swarming rule. 551-560

Alberto Dennunzio, Enrico Formenti
, Luca Manzoni
, Giancarlo Mauri
:
m-Asynchronous cellular automata: from fairness to quasi-fairness. 561-572

Fernando Silva, Luís Correia
:
An experimental study of noise and asynchrony in elementary cellular automata with sampling compensation. 573-588

Szilárd Zsolt Fazekas
, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi:
On computational complexity of graph inference from counting. 589-603

Yangyang Li, Peidao Li, Bo Wu, Licheng Jiao, Ronghua Shang:
Kernel clustering using a hybrid memetic algorithm. 605-615

Fei Liu, Monika Heiner
:
Modeling membrane systems using colored stochastic Petri nets. 617-629

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from
to the list of external document links (if available).
load links from unpaywall.org
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the
of the Internet Archive (if available).
load content from archive.org
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from
,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from
and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from
.
load data from openalex.org
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:







