Sciweavers

2774 search results - page 534 / 555
» Exploiting Deep Structure
Sort
View
143
Voted
PDPTA
2000
15 years 4 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed
158
Voted
TREC
2000
15 years 3 months ago
Syntactic Clues and Lexical Resources in Question-Answering
CL Research's question-answering system (DIMAP-QA) for TREC-9 significantly extends its semantic relation triple (logical form) technology in which documents are fully parsed...
Kenneth C. Litkowski
139
Voted
DAGSTUHL
1996
15 years 3 months ago
A Uniform Approach for Compile-Time and Run-Time Specialization
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
Charles Consel, Luke Hornof, François No&eu...
107
Voted
OSDI
1994
ACM
15 years 3 months ago
Performance Issues in Parallelized Network Protocols
Parallel processing has been proposed as a means of improving network protocol throughput. Several different strategies have been taken towards parallelizing protocols. A relative...
Erich M. Nahum, David J. Yates, James F. Kurose, D...
128
Voted
AIPS
2009
15 years 3 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...