Sciweavers

1404 search results - page 8 / 281
» Complexity of admissible rules
Sort
View
SEMWEB
2005
Springer
14 years 3 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst
KR
2000
Springer
14 years 1 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
TWC
2008
150views more  TWC 2008»
13 years 9 months ago
Convex approximation techniques for joint multiuser downlink beamforming and admission control
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
Evaggelia Matskani, Nicholas D. Sidiropoulos, Zhi-...
WCNC
2008
IEEE
14 years 4 months ago
A Maximum-Throughput Call Admission Control Policy for CDMA Beamforming Systems
— A throughput-maximization call admission control (CAC) policy is proposed for CDMA beamforming systems in which the QoS requirements in both physical and network layers can be ...
Wei Sheng, Steven D. Blostein
ICNP
2007
IEEE
14 years 4 months ago
Distributed Delay Estimation and Call Admission Control in IEEE 802.11 WLANs
—Voice over WiFi (VoWiFi) will soon be the main alternative to cellular phones. Providing a satisfactory user experience remains difficult, however. We focus on Call Admission C...
Kenta Yasukawa, Andrea G. Forte, Henning Schulzrin...