6274 search results - page 33 / 1255 » From query complexity to computational complexity |
98
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
109
Voted
SP
2008
IEEE
15 years 2 months ago
2008
IEEE
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...
119
Voted
AAAI
2000
15 years 4 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...
138
Voted
COCOA
2010
Springer
14 years 9 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
CAGD
2010
15 years 2 months ago
2010
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...