Sciweavers

2273 search results - page 90 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 10 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
NAR
2011
357views Computer Vision» more  NAR 2011»
14 years 4 months ago
miRGator v2.0 : an integrated system for functional investigation of microRNAs
miRGator is an integrated database of microRNA (miRNA)-associated gene expression, target prediction, disease association and genomic annotation, which aims to facilitate function...
Sooyoung Cho, Yukyung Jun, Sanghyun Lee, Hyung-Seo...
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
LICS
2008
IEEE
15 years 4 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
INFOCOM
2006
IEEE
15 years 3 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer