1641 search results - page 65 / 329 » Termination Analysis with Algorithmic Learning |
115
Voted
WDAG
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
127
Voted
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
123
click to vote
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
135
Voted
POPL
2004
ACM
15 years 9 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
134
Voted
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...