159 search results - page 26 / 32 » Computational Complexity of Fundamental Problems in Social C... |
IJCAI
1989
15 years 1 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
MST
2006
14 years 11 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
SEMWEB
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
AI
2000
Springer
14 years 11 months ago
2000
Springer
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...