Sciweavers

1999 search results - page 103 / 400
» Dependently Typed Grammars
Sort
View
ICSE
2004
IEEE-ACM
16 years 6 months ago
Concerning Predictability in Dependable Component-Based Systems: Classification of Quality Attributes
One of the main objectives of developing component-based software systems is to enable efficient building of systems through the integration of components. All component models def...
Ivica Crnkovic, Magnus Larsson, Otto Preiss
ISCC
2000
IEEE
15 years 10 months ago
On Multiple Traffic Type Integration over Wireless TDMA Channels
A new medium access control (MAC) protocol for mobile wireless communications is presented and investigated. We explore, via an extensive simulation study, the performance of the ...
Polychronis Koutsakis, Michael Paterakis
TKDE
2010
149views more  TKDE 2010»
15 years 28 days ago
A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
Davide Sottara, Paola Mello, Mark Proctor
SIGIR
2009
ACM
16 years 22 days ago
Query dependent pseudo-relevance feedback based on wikipedia
Pseudo-relevance feedback (PRF) via query-expansion has been proven to be effective in many information retrieval (IR) tasks. In most existing work, the top-ranked documents from...
Yang Xu, Gareth J. F. Jones, Bin Wang
DCC
2008
IEEE
16 years 5 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir