Sciweavers

3443 search results - page 166 / 689
» More Algebras for Determiners
Sort
View
99
Voted
ICS
2010
Tsinghua U.
15 years 3 months ago
Speeding up Nek5000 with autotuning and specialization
Autotuning technology has emerged recently as a systematic process for evaluating alternative implementations of a computation, in order to select the best-performing solution for...
Jaewook Shin, Mary W. Hall, Jacqueline Chame, Chun...
96
Voted
AIPS
2008
15 years 3 months ago
Efficient ADD Operations for Point-Based Algorithms
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solom...
AIPS
2008
15 years 3 months ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte
88
Voted
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
15 years 2 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
103
Voted
FM
2008
Springer
127views Formal Methods» more  FM 2008»
15 years 2 months ago
A Schedulerless Semantics of TLM Models Written in SystemC Via Translation into LOTOS
TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used fo...
Olivier Ponsini, Wendelin Serwe