3758 search results - page 398 / 752 » A Complete Subsumption Algorithm |
185
click to vote
FORTE
1997
15 years 8 months ago
1997
This paper presents a testing theory that is parameterised with assumptions about the way implementations communicate with their environment. In this way some existing testing the...
153
click to vote
IJCAI
1997
15 years 8 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
197
click to vote
VCIP
2000
15 years 8 months ago
2000
Concentric mosaics have the ability to quickly capture a complete 3D view of a realistic environment and to enable a user to wander freely in the environment. However, the data am...
166
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
iProver-Eq is an implementation of an instantiation-based calculus Inst-Gen-Eq which is complete for first-order logic with equality. iProver-Eq extends the iProver system with sup...
187
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
The structure of a Markov network is typically learned using top-down search. At each step, the search specializes a feature by conjoining it to the variable or feature that most ...