Sciweavers

1717 search results - page 283 / 344
» A Computable Spectral Theorem
Sort
View
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 18 days ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
108
Voted
JCP
2008
116views more  JCP 2008»
15 years 15 days ago
Formal Verification and Visualization of Security Policies
Verified and validated security policies are essential components of high assurance computer systems. The design and implementation of security policies are fundamental processes i...
Luay A. Wahsheh, Daniel Conte de Leon, Jim Alves-F...
GC
2007
Springer
15 years 14 days ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
SAC
2006
ACM
15 years 13 days ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
85
Voted
JCC
2007
131views more  JCC 2007»
15 years 13 days ago
An extended dead-end elimination algorithm to determine gap-free lists of low energy states
: Proteins are flexible systems and commonly populate several functionally important states. To understand protein function, these states and their energies have to be identified...
Edda Kloppmann, G. Matthias Ullmann, Torsten Becke...