Sciweavers

1548 search results - page 284 / 310
» Computational Approaches to Sentence Completion
Sort
View
CCS
2008
ACM
13 years 10 months ago
Towards an efficient and language-agnostic compliance checker for trust negotiation systems
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...
Adam J. Lee, Marianne Winslett
FM
2008
Springer
152views Formal Methods» more  FM 2008»
13 years 10 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
BMCBI
2010
84views more  BMCBI 2010»
13 years 8 months ago
A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysis
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. ...
BMCBI
2008
78views more  BMCBI 2008»
13 years 8 months ago
Deducing topology of protein-protein interaction networks from experimentally measured sub-networks
Background: Protein-protein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallym...
Ling Yang, Thomas M. Vondriska, Zhangang Han, W. R...
COR
2010
123views more  COR 2010»
13 years 8 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...