3758 search results - page 376 / 752 » A Complete Subsumption Algorithm |
196
click to vote
LICS
2005
IEEE
16 years 9 days ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
190
click to vote
ASP
2005
Springer
16 years 8 days ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
146
click to vote
ATAL
2005
Springer
16 years 8 days ago
2005
Springer
This paper presents a new and innovative approach called mission-based just in time agent generation. The approach allows agents to be constructed on the fly, at run-time and just...
164
click to vote
COCO
2005
Springer
16 years 8 days ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
191
click to vote
CSCLP
2005
Springer
16 years 8 days ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...