Sciweavers

458 search results - page 12 / 92
» Perfect Skolem sets
Sort
View
TPDS
1998
114views more  TPDS 1998»
14 years 11 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
FOCS
2000
IEEE
15 years 4 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
AAAI
2010
15 years 1 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...
AAAI
1990
15 years 1 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
JSYML
2008
72views more  JSYML 2008»
14 years 12 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson