1355 search results - page 240 / 271 » Alternating Timed Automata over Bounded Time |
177
click to vote
CASES
2005
ACM
15 years 7 months ago
2005
ACM
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
134
Voted
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...
159
Voted
BMCBI
2008
15 years 5 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
178
click to vote
JOC
2011
15 years 9 days ago
2011
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
159
click to vote
STACS
2010
Springer
16 years 10 days ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...