221 search results - page 19 / 45 » Nine Ways to Find a Solution |
ENTCS
2008
13 years 7 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
JDI
2006
13 years 7 months ago
2006
: The next `killer ap' is a term the software development community uses to describe its great quest for advancing technology by defining and meeting users' needs and wan...
HIS
2009
13 years 5 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
AAAI
2004
13 years 8 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...