Information integrity in cache memories is a fundamental requirement for dependable computing. Conventional architectures for enhancing cache reliability using check codes make it...
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Coordinating goals, schedules, and tasks among collaborators is difficult, and made even more so when there are disciplinary, geographic and institutional boundaries that must be ...
Saeko Nomura, Jeremy P. Birnholtz, Oya Rieger, Gil...
We have developed SWAP, a system that automatically detects process dependencies and accounts for such dependencies in scheduling. SWAP uses system call history to determine possi...
In TREC 2004, the Database and Information System Lab (DBIS) at University of Illinois at Chicago (UIC) participates in the robust track, which is a traditional ad hoc retrieval t...