680 search results - page 6 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
AAAI
2000
13 years 9 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
KI
2009
Springer
14 years 2 months ago
2009
Springer
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...
DAGSTUHL
2003
13 years 9 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
MSWIM
2003
ACM
14 years 1 months ago
2003
ACM
Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up a...