John S. Conery - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2012

Computation is Symbol ManipulationJohn S. Conery. cj, 55(7):814-816, 2012. [doi]

2010

Ubiquity symposium 'What is computation?': Computation is symbol manipulationJohn S. Conery. ubiquity, 2010(November):4, 2010. [doi]

2007

Aligning Sequences by Minimum Description LengthJohn S. Conery. ejbsb, 2007, 2007. [doi]

2006

Clustered Neural Dynamics Identify Motifs for Chemotaxis in Caenorhabditis elegansNathan A. Dunn, Jonathan T. Pierce-Shimomura, John S. Conery, Shawn R. Lockery. ijcnn 2006: 547-554 [doi]

2005

Rule-based workflow management for bioinformaticsJohn S. Conery, Julian Catchen, Michael Lynch. vldb, 14(3):318-329, 2005. [doi]

2004

A Neural Network Model of Chemotaxis Predicts Functions of Synaptic Connections in the Nematode ::::Caenorhabditis elegans::::Nathan A. Dunn, Shawn R. Lockery, Jonathan T. Pierce-Shimomura, John S. Conery. jcns, 17(2):137-147, 2004. [doi]

2003

Circuit Optimization Predicts Dynamic Network for Chemosensory Orientation in the Nematode C. elegansNathan A. Dunn, John S. Conery, Shawn R. Lockery. nips 2004: 1279-1286 [doi]

A neural network model for chemotaxis in Caenorhabditis elegansNathan A. Dunn, John S. Conery, Shawn R. Lockery. ijcnn 2003: 2574-2578 [doi]

2001

Nucleotide Substitutions and the Evolution of Duplicate GenesJohn S. Conery, Michael Lynch. psb 2001: 167-178 [doi]

1999

Genetic Simulation LibraryJohn S. Conery, Michael Lynch. bioinformatics, 15(1):85-86, 1999.

1997

Distributed Simulation of Spatially Explicit Ecological ModelsKevin Glass, Marilynn Livingston, John S. Conery. pads 1997: 60-63 [doi]

1995

A parallel algorithm for calculating the potential energy in DNAJohn S. Conery, Warner L. Peticolas, Thomas Rush III, Kesavan Shanmugam, Jose Dominguez. hicss 1995: 123-131 [doi]

1994

Continuation-Based Control in the Implementation of Parallel Logic ProgramsJohn S. Conery. lisp, 7(1):111-134, 1994.

1992

Parallel Logic Programs on the MayflyJohn S. Conery. lisp, 5(1-2):49-72, 1992.

An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic ProgramsRenganathan Sundararajan, John S. Conery. fsttcs 1992: 203-216

1990

Architected Failure Handling for AND-Parallel Logic ProgramsDavid M. Meyer, John S. Conery. ICLP 1990: 271-290

1988

Logic Programming Research in OregonJohn S. Conery. compcon 1988: 74-81

Logical ObjectsJohn S. Conery. ICLP 1988: 420-434

Binding environments for parallel logic programs in non-shared memory multiprocessorsJohn S. Conery. ijpp, 17(2):125-152, 1988. [doi]

1987

Binding Environments for Parallel Logic Programs in Non-Shared Memory MultiprocessorsJohn S. Conery. SLP 1987: 457-467

Implementing Backward Execution in Non-Deterministic AND-Parallel SystemsJohn S. Conery. iclp 1987: 633-653

1985

AND Parallelism and Nondeterminism in Logic ProgramsJohn S. Conery, Dennis F. Kibler. ngc, 3(1):43-70, 1985.

Parallelism in AI ProgramsDennis F. Kibler, John S. Conery. IJCAI 1985: 53-56

1983

AND Parallelism in Logic ProgramsJohn S. Conery, Dennis F. Kibler. IJCAI 1983: 539-543

1981

Parallel interpretation of logic programsJohn S. Conery, Dennis F. Kibler. fpca 1981: 163-170 [doi]

Sign in or sign up to see more results.

runs on WebDSL