Sciweavers

1061 search results - page 63 / 213
» Natural Selection in Relation to Complexity
Sort
View
CONCUR
2007
Springer
14 years 3 months ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson
CSEE
2003
Springer
14 years 2 months ago
Is Software Engineering Training Enough for Software Engineers
Most software engineering courses focus exclusively on the software development process, often referring to problems related to the complexity of software products and processes. ...
Ivica Crnkovic, Rikard Land, Andreas Sjögren
TABLEAUX
1999
Springer
14 years 1 months ago
A Tableau Calculus for Pronoun Resolution
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
Christof Monz, Maarten de Rijke
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 9 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
BMCBI
2010
164views more  BMCBI 2010»
13 years 9 months ago
Gene regulatory networks modelling using a dynamic evolutionary hybrid
Background: Inference of gene regulatory networks is a key goal in the quest for understanding fundamental cellular processes and revealing underlying relations among genes. With ...
Ioannis A. Maraziotis, Andrei Dragomir, Dimitris T...