2233 search results - page 270 / 447 » On the Complexity of Theory Curbing |
192
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
192
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
201
click to vote
IANDC
2008
15 years 6 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
192
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...