Sciweavers

200 search results - page 40 / 40
» Tyrolean Termination Tool
Sort
View
AAAI
1994
13 years 6 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
DAGSTUHL
1996
13 years 6 months ago
What Not to Do When Writing an Interpreter for Specialisation
A partial evaluator, given a program and a known "static" part of its input data, outputs a specialised or residual program in which computations depending only on the st...
Neil D. Jones
BMCBI
2008
115views more  BMCBI 2008»
13 years 5 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
IJFCS
2006
130views more  IJFCS 2006»
13 years 5 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
BMCBI
2006
123views more  BMCBI 2006»
13 years 5 months ago
Computational models with thermodynamic and composition features improve siRNA design
Background: Small interfering RNAs (siRNAs) have become an important tool in cell and molecular biology. Reliable design of siRNA molecules is essential for the needs of large fun...
Svetlana A. Shabalina, Alexey N. Spiridonov, Aleks...