Sciweavers

1029 search results - page 114 / 206
» Compact representations of ordered sets
Sort
View
CAV
2011
Springer
234views Hardware» more  CAV 2011»
14 years 6 months ago
Resolution Proofs and Skolem Functions in QBF Evaluation and Applications
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
Valeriy Balabanov, Jie-Hong R. Jiang
128
Voted
AAAI
2012
13 years 4 months ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...
ICFCA
2004
Springer
15 years 7 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
ENTCS
2002
181views more  ENTCS 2002»
15 years 2 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
159
Voted
CCCG
1998
15 years 3 months ago
Dynamic maintenance and visualization of molecular surfaces
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...
Chandrajit L. Bajaj, Valerio Pascucci, Robert J. H...