Sciweavers

365 search results - page 65 / 73
» Types for Safe Locking
Sort
View
BMCBI
2005
99views more  BMCBI 2005»
13 years 8 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 8 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
TC
2010
13 years 7 months ago
QoS Control for Pipelines of Tasks Using Multiple Resources
We consider soft real-time applications organised as pipelines of tasks using resources of different type (communication, computation, storage). The applications are assumed to be...
Tommaso Cucinotta, Luigi Palopoli
RULEML
2010
Springer
13 years 6 months ago
A Contract Agreement Policy-Based Workflow Methodology for Agents Interacting in the Semantic Web
The Semantic Web aims at automating Web content understanding and user request satisfaction. Intelligent agents assist towards this by performing complex actions on behalf of their...
Kalliopi Kravari, Grammati-Eirini Kastori, Nick Ba...
PLDI
2006
ACM
14 years 2 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa