1686 search results - page 143 / 338 » Programs as polygraphs: computability and complexity |
131
Voted
CG
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. By developing an intelligent computer system that will provide commentary of chess moves in a comprehensible, user-friendly and instructive way, we are trying to use the ...
141
Voted
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
94
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
114
Voted
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
100
Voted
OWLED
2008
15 years 5 months ago
2008
OWL ontologies are complex computational artifacts that are intimately connected with conceptual information and with application issues that are not easily explicable in the conte...