Sciweavers

2797 search results - page 402 / 560
» Control Structures
Sort
View
POPL
2000
ACM
15 years 8 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
AIPS
2010
15 years 7 months ago
Shopper: A System for Executing and Simulating Expressive Plans
We present Shopper, a plan execution engine that facilitates experimental evaluation of plans and makes it easier for planning researchers to incorporate replanning. Shopper inter...
Robert P. Goldman, John Maraist
BMCBI
2008
116views more  BMCBI 2008»
15 years 5 months ago
Gene Ontology annotations: what they mean and where they come from
To address the challenges of information integration and retrieval, the computational genomics community increasingly has come to rely on the methodology of creating annotations o...
David P. Hill, Barry Smith, Monica S. McAndrews-Hi...
BIBE
2009
IEEE
185views Bioinformatics» more  BIBE 2009»
15 years 10 months ago
Anomaly-free Prediction of Gene Ontology Annotations Using Bayesian Networks
Gene and protein structural and functional annotations expressed through controlled terminologies and ontologies are paramount especially for the aim of inferring new biomedical k...
Marco Tagliasacchi, Marco Masseroli
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 9 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil