10608 search results - page 650 / 2122 » Complexity of O'Hara's Algorithm |
159
click to vote
LPAR
1994
Springer
15 years 11 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
200
click to vote
ACSD
2004
IEEE
15 years 11 months ago
2004
IEEE
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...
167
click to vote
AAAI
2008
15 years 9 months ago
2008
Potential-based shaping was designed as a way of introducing background knowledge into model-free reinforcement-learning algorithms. By identifying states that are likely to have ...
192
click to vote
CICLING
2008
Springer
15 years 9 months ago
2008
Springer
This paper investigates the problem of automatic chemical Term Recognition (TR) and proposes to tackle the problem by fusing Symbolic and statistical techniques. Unlike other solut...
187
click to vote
CIE
2008
Springer
15 years 9 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...