Brian J. Ross
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Brian J. Ross has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Adam Hewgill
Department of Computer Science, Brock University, 500 Glenridge Avenue, St. Catharines, Ont., Canada L2S 3A1
1 shared publication D.Y. Yashkir
Department of Computer Science, Brock University, St. Catharines, Ontario L2S 3A1, Canada; CA
1 shared publicationF. Fueten
Department of Earth Sciences, Brock University, St. Catharines, Ontario L2S 3A1, Canada CA
1 shared publicationHan Zhu
Brock University
1 shared publication
Latest Publications
- 1 September 2004
- Published by Springer Nature in New Generation Computing
- Vol. 22 (3) , 271-293
Procedural texture evolution using multi-objective optimization
- 1 September 2004
- Published by Springer Nature in New Generation Computing
- Vol. 22 (3) , 271-293
Procedural texture evolution using multi-objective optimization
- 1 August 2004
- Published by Elsevier in Computers & Graphics
- Vol. 28 (4) , 569-584
Procedural 3D texture synthesis using genetic programming
- 1 August 2004
- Published by Elsevier in Computers & Graphics
- Vol. 28 (4) , 569-584
Procedural 3D texture synthesis using genetic programming
- 1 June 2002
- Published by Springer Nature in New Generation Computing
- Vol. 20 (2) , 187-213
The evolution of stochastic regular motifs for protein sequences
- 1 June 2002
- Published by Springer Nature in New Generation Computing
- Vol. 20 (2) , 187-213
The evolution of stochastic regular motifs for protein sequences
- 1 December 2001
- Published by Springer Nature in New Generation Computing
- Vol. 19 (4) , 313-337
Logic-based genetic programming with definite clause translation grammars
- 1 December 2001
- Published by Springer Nature in New Generation Computing
- Vol. 19 (4) , 313-337
Logic-based genetic programming with definite clause translation grammars
- 1 November 2001
- Published by Springer Nature in Machine Vision and Applications
- Vol. 13 (2) , 61-69
Automatic mineral identification using genetic programming
- 1 November 2001
- Published by Springer Nature in Machine Vision and Applications
- Vol. 13 (2) , 61-69
Automatic mineral identification using genetic programming
- Open Access
- 1 May 1997
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 9 (3) , 331-348
Running programs backwards: The logical inversion of imperative computation
Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools.
- 1 May 1997
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 9 (3) , 331-348
Open AccessRunning programs backwards: The logical inversion of imperative computation
Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools.