Sciweavers

1029 search results - page 9 / 206
» Compact representations of ordered sets
Sort
View
112
Voted
SMA
2009
ACM
105views Solid Modeling» more  SMA 2009»
15 years 7 months ago
SOT: compact representation for tetrahedral meshes
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex reference...
Topraj Gurung, Jarek Rossignac
IJCAI
2007
15 years 2 months ago
First Order Decision Diagrams for Relational MDPs
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
Chenggang Wang, Saket Joshi, Roni Khardon
86
Voted
ENTCS
2006
136views more  ENTCS 2006»
15 years 19 days ago
Priestley Duality for Strong Proximity Lattices
In 1937 Marshall Stone extended his celebrated representation theorem for Boolean algebras to distributive lattices. In modern terminology, the representing topological spaces are...
Mohamed A. El-Zawawy, Achim Jung
IJPRAI
2000
108views more  IJPRAI 2000»
15 years 13 days ago
Knowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
Helmut Prendinger, Mitsuru Ishizuka, Gerhard Schur...
AIPS
2008
15 years 2 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon