1941 search results - page 238 / 389 » On the Hardness of Approximate Reasoning |
147
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
167
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
A protein is identified by a finite sequence of aminoacids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting t...
166
click to vote
MABS
2004
Springer
15 years 11 months ago
2004
Springer
The emerging ”Computational Grid” infrastructure poses many new opportunities for the developing science of large scale multiagent simulation. The ability to migrate agent expe...
162
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
System-on-chip (SoC) designs use bus protocols for high performance data transfer among the Intellectual Property (IP) cores. These protocols incorporate advanced features such as...
190
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...