14518 search results - page 2685 / 2904 » Two Problems for Sophistication |
144
click to vote
STACS
2010
Springer
15 years 11 months 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...
139
click to vote
ISPASS
2010
IEEE
15 years 11 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...
125
click to vote
ASPLOS
2010
ACM
15 years 11 months ago
2010
ACM
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
144
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
122
click to vote
IPSN
2010
Springer
15 years 11 months ago
2010
Springer
bstract: User-Centric Radio Power Control for Opportunistic Mountain Hiking Networks ∗ Jyh-How Huang1 , Po-Yen Lin1 , Yu-Te Huang2 , Seng-Yong Lau1 , Ling-Jyh Chen2 , Kun-chan La...