2519 search results - page 373 / 504 » Reasoning with Textual Cases |
139
click to vote
PODC
2004
ACM
15 years 10 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...
143
click to vote
SAC
2004
ACM
15 years 10 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
126
click to vote
SAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper aims to describe the relationship between propositional planning systems and the process of means-end reasoning used by BDI agents. To show such relationship, we defin...
132
click to vote
AIRS
2004
Springer
15 years 10 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
122
click to vote
CARDIS
2004
Springer
15 years 10 months ago
2004
Springer
More and more services provided by Internet pose a problem of privacy and anonymity. One cryptographic tool that could be used for solving this problem is the group signature [1, 5...