Sciweavers

1763 search results - page 111 / 353
» A Formalization of Polytime Functions
Sort
View
RECOMB
2002
Springer
15 years 10 months ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler
LPNMR
2009
Springer
15 years 4 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
FMICS
2006
Springer
15 years 1 months ago
Test Coverage for Loose Timing Annotations
Abstract. The design flow of systems-on-a-chip (SoCs) identifies several abstraction levels higher than the Register-Transfer-Level that constitutes the input of the synthesis tool...
Claude Helmstetter, Florence Maraninchi, Laurent M...
FOIS
2006
14 years 11 months ago
Behavior of a Technical Artifact: An Ontological Perspective in Engineering
The term `behavior' is used ubiquitously in engineering. It refers roughly to the way technical artifacts `behave' in a given or hypothetical situation, and plays a pivot...
Stefano Borgo, Massimiliano Carrara, Pieter E. Ver...
ENTCS
2002
97views more  ENTCS 2002»
14 years 9 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott