6358 search results - page 1000 / 1272 » Computing spectral sequences |
183
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
162
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
177
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
222
click to vote
AGENTCL
2003
Springer
15 years 12 months ago
2003
Springer
The goal of this paper is to present a computational framework that enables us to generate elementary speech act sequences in a dialogue between an electronic assistant and a compu...
193
click to vote
CCS
2003
ACM
15 years 12 months ago
2003
ACM
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...