Sciweavers

240 search results - page 22 / 48
» Infinite trace equivalence
Sort
View
CGF
2007
128views more  CGF 2007»
13 years 8 months ago
Stackless KD-Tree Traversal for High Performance GPU Ray Tracing
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet availa...
Stefan Popov, Johannes Günther, Hans-Peter Se...
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 3 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
ATAL
2010
Springer
13 years 9 months ago
Characterising and matching iterative and recursive agent interaction protocols
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
Tim Miller, Peter McBurney
JAIR
2008
92views more  JAIR 2008»
13 years 8 months ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer
JGT
2006
60views more  JGT 2006»
13 years 8 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato