2767 search results - page 313 / 554 » Universal Exponentiation Algorithm |
125
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
138
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
77
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
149
Voted
ADBIS
2010
Springer
15 years 3 months ago
2010
Springer
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...
135
Voted
ENTCS
2007
15 years 2 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...