Sciweavers

4037 search results - page 116 / 808
» Routing without ordering
Sort
View
ICS
2000
Tsinghua U.
14 years 22 days ago
Hardware-only stream prefetching and dynamic access ordering
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
Chengqiang Zhang, Sally A. McKee
AIPS
2007
13 years 11 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
ESOP
2008
Springer
13 years 11 months ago
Practical Programming with Higher-Order Encodings and Dependent Types
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
Adam Poswolsky, Carsten Schürmann
SBBD
2004
166views Database» more  SBBD 2004»
13 years 10 months ago
An Apriori-based Approach for First-Order Temporal Pattern Mining
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequen...
Sandra de Amo, Daniel A. Furtado, Arnaud Giacomett...
AAAI
2011
12 years 9 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos