1941 search results - page 237 / 389 » On the Hardness of Approximate Reasoning |
161
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
One aspect of rational behavior is that agents can pursue multiple goals in parallel. Current BDI theory and systems do not provide a theoretical or architectural framework for de...
176
click to vote
DCOSS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
171
click to vote
IMA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Identity-based encryption (IBE) is a special asymmetric encryption method where a public encryption key can be an arbitrary identifier and the corresponding private decr...
166
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
171
click to vote
PODC
2004
ACM
15 years 12 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...