Sciweavers

441 search results - page 77 / 89
» Possibility theory and statistical reasoning
Sort
View
POPL
2004
ACM
14 years 8 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
ATAL
2010
Springer
13 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
BMCBI
2006
147views more  BMCBI 2006»
13 years 7 months ago
A case study in pathway knowledgebase verification
Background: Biological databases and pathway knowledgebases are proliferating rapidly. We are developing software tools for computer-aided hypothesis design and evaluation, and we...
Stephen A. Racunas, Nigam Shah, Nina V. Fedoroff
SIAMAM
2008
170views more  SIAMAM 2008»
13 years 7 months ago
Absolute Stability and Complete Synchronization in a Class of Neural Fields Models
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
Olivier D. Faugeras, François Grimbert, Jea...
RE
2006
Springer
13 years 7 months ago
Interaction Analysis in Aspect-Oriented Models
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
Katharina Mehner, Mattia Monga, Gabriele Taentzer