777 search results - page 59 / 156 » A fast algorithm for the computation of an upper bound on th... |
EGH
2009
Springer
13 years 5 months ago
2009
Springer
We discuss the mapping of elementary ray tracing operations-acceleration structure traversal and primitive intersection--onto wide SIMD/SIMT machines. Our focus is on NVIDIA GPUs,...
COMPUTING
2007
13 years 7 months ago
2007
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
AIPS
2008
13 years 10 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
SAS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...