Sciweavers

9284 search results - page 473 / 1857
» Knowledge State Algorithms
Sort
View
CHARME
2005
Springer
133views Hardware» more  CHARME 2005»
16 years 1 months ago
Symbolic Partial Order Reduction for Rule Based Transition Systems
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. In this paper, we develop a partial order reduction algorithm for rule-bas...
Ritwik Bhattacharya, Steven M. German, Ganesh Gopa...
FMCAD
2006
Springer
15 years 11 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
198
Voted
SODA
2004
ACM
74views Algorithms» more  SODA 2004»
15 years 9 months ago
Torpid mixing of simulated tempering on the Potts model
Simulated tempering and swapping are two families of sampling algorithms in which a parameter representing temperature varies during the simulation. The hope is that this will ove...
Nayantara Bhatnagar, Dana Randall
249
Voted
ENTCS
2010
122views more  ENTCS 2010»
15 years 5 months ago
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
Trevor Jim, Yitzhak Mandelbaum
AAAI
2004
15 years 9 months ago
Learning and Applying Competitive Strategies
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
Esther Lock, Susan L. Epstein