155 search results - page 29 / 31 » Bounded Arithmetic and Descriptive Complexity |
COLT
2003
Springer
14 years 18 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
SIGGRAPH
2010
ACM
13 years 12 months ago
2010
ACM
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
CP
1997
Springer
13 years 11 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
DLOG
2010
13 years 5 months ago
2010
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
DLOG
2004
13 years 8 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...