Sciweavers

1055 search results - page 87 / 211
» Enumerations in computable structure theory
Sort
View
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
15 years 9 months ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali
ATAL
2006
Springer
15 years 8 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
CSDA
2007
116views more  CSDA 2007»
15 years 4 months ago
Exploring the state sequence space for hidden Markov and semi-Markov chains
The knowledge of the state sequences that explain a given observed sequence for a known hidden Markovian model is the basis of various methods that may be divided into three categ...
Yann Guédon
SMI
2005
IEEE
15 years 10 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
ESOP
2009
Springer
15 years 11 months ago
Conversation Types
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...
Luís Caires, Hugo Torres Vieira