Sciweavers

1677 search results - page 46 / 336
» On the Completeness of Quantum Computation Models
Sort
View
LPAR
2010
Springer
14 years 11 months ago
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
Michael Gabbay, Murdoch James Gabbay
COMPSAC
2008
IEEE
15 years 8 months ago
Utilising Located Functions to Model and Optimise Distributed Computations
With developments in Grid computing and Web based data storage the task of orchestrating computations is becoming ever more difficult. Identifying which of the available computati...
Stephen Crouch, Peter Henderson, Robert John Walte...
CIBCB
2006
IEEE
15 years 7 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
135
Voted
ML
2000
ACM
244views Machine Learning» more  ML 2000»
15 years 1 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
CLUSTER
2007
IEEE
15 years 7 months ago
Non-collective parallel I/O for global address space programming models
— Achieving high performance for out-of-core applications typically involves explicit management of the movement of data between the disk and the physical memory. We are developi...
Sriram Krishnamoorthy, Juan Piernas, Vinod Tippara...