1941 search results - page 40 / 389 » On the Hardness of Approximate Reasoning |
CCGRID
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
112
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
115
click to vote
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
109
click to vote
JSA
2000
14 years 11 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...