Sciweavers

4231 search results - page 800 / 847
» Using Language More Responsibly
Sort
View
118
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 6 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
110
Voted
OOPSLA
1999
Springer
15 years 6 months ago
Age-Based Garbage Collection
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which ...
Darko Stefanovic, Kathryn S. McKinley, J. Eliot B....
123
Voted
SIGIR
2010
ACM
15 years 6 months ago
Positional relevance model for pseudo-relevance feedback
Pseudo-relevance feedback is an effective technique for improving retrieval results. Traditional feedback algorithms use a whole feedback document as a unit to extract words for ...
Yuanhua Lv, ChengXiang Zhai
ECAI
1998
Springer
15 years 6 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
129
Voted
FPGA
2000
ACM
177views FPGA» more  FPGA 2000»
15 years 6 months ago
Automatic generation of FPGA routing architectures from high-level descriptions
In this paper we present a "high-level" FPGA architecture description language which lets FPGA architects succinctly and quickly describe an FPGA routing architecture. W...
Vaughn Betz, Jonathan Rose