Sciweavers

1027 search results - page 109 / 206
» Callgraph properties of executables
Sort
View
117
Voted
PDPTA
2003
15 years 5 months ago
A Universal Parallel SAT Checking Kernel
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
Wolfgang Blochinger, Carsten Sinz, Wolfgang Kü...
108
Voted
AAAI
2000
15 years 5 months ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig
114
Voted
COLING
1994
15 years 5 months ago
Universal Guides And Finiteness And Symmetry Of Grammar Processing Algorithms
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
Miroslav Martinovic
122
Voted
IJCAI
1989
15 years 4 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
117
Voted
CGF
2010
115views more  CGF 2010»
15 years 3 months ago
Visualization and Analysis-Oriented Reconstruction of Material Interfaces
Reconstructing boundaries along material interfaces from volume fractions is a difficult problem, especially because the under-resolved nature of the input data allows for many co...
Jeremy S. Meredith, Hank Childs