Sciweavers

2490 search results - page 394 / 498
» Complexity of Contextual Reasoning
Sort
View
BIB
2006
84views more  BIB 2006»
14 years 10 months ago
Computational methodologies for modelling, analysis and simulation of signalling networks
This article is a critical review of computational techniques used to model, analyse and simulate signalling networks. We propose a conceptual framework, and discuss the role of s...
David R. Gilbert, Hendrik Fuß, Xu Gu, Richar...
IANDC
2008
120views more  IANDC 2008»
14 years 10 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
88
Voted
COGSCI
2006
127views more  COGSCI 2006»
14 years 10 months ago
Decision Making and Confidence Given Uncertain Advice
We study human decision making in a simple forced-choice task that manipulates the frequency and accuracy of available information. Empirically, we find that people make decisions...
Michael D. Lee, Matthew J. Dry
ENTCS
2006
113views more  ENTCS 2006»
14 years 10 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
78
Voted
FMSD
2006
140views more  FMSD 2006»
14 years 10 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...