Sciweavers

1404 search results - page 210 / 281
» Complexity of admissible rules
Sort
View
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 3 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
ERSHOV
2009
Springer
14 years 3 months ago
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
Florian Fischer, Gulay Ünel, Barry Bishop, Di...
ICC
2008
IEEE
197views Communications» more  ICC 2008»
14 years 3 months ago
V-BLAST Receiver and Performance In MIMO Relay Networks with Imperfect CSI
Abstract —Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO c...
Jiansong Chen, Xiaoli Yu, C. C. Jay Kuo
SAC
2004
ACM
14 years 2 months ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
DLOG
2001
13 years 10 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat