Sciweavers

1404 search results - page 5 / 281
» Complexity of admissible rules
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Adaptive Admission Control Algorithm for Multiuser OFDMA Wireless Networks
—We propose a new adaptive admission control scheme for multiuser OFDMA systems to allocate wireless resource with low complexity. In this adaptive admission control scheme, the ...
Kyung-Ho Sohn, Jongkyung Kim, Tae Sung Kim, Young ...
IANDC
2010
141views more  IANDC 2010»
13 years 8 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
IGPL
1998
64views more  IGPL 1998»
13 years 9 months ago
Formulas for which Contraction is Admissible
A formula A is said to have the contractionproperty in a logic L i whenever A;A;? `L B (when ? is a multiset) also A;? `L B. In MLL and in MALL without the additive constants a fo...
Arnon Avron
AI
2002
Springer
13 years 9 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
CN
2006
111views more  CN 2006»
13 years 9 months ago
Analytical modeling of CAC in next generation wireless systems
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
Tuna Tugcu, H. Birkan Yilmaz, Feodor S. Vainstein