Sciweavers

2231 search results - page 434 / 447
» Alternation as a programming paradigm
Sort
View
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
DBPL
2003
Springer
92views Database» more  DBPL 2003»
15 years 9 months ago
A Query Algebra for Fragmented XML Stream Data
The increased usage of mobile devices coupled with an unprecedented demand for information has pushed the scalability problem of pull-based data service to the focus. A broadcast ...
Sujoe Bose, Leonidas Fegaras, David Levine, Vamsi ...
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
15 years 9 months ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
INFOCOM
2000
IEEE
15 years 8 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
140
Voted
ISCA
2000
IEEE
121views Hardware» more  ISCA 2000»
15 years 8 months ago
Selective, accurate, and timely self-invalidation using last-touch prediction
Communication in cache-coherent distributed shared memory (DSM) often requires invalidating (or writing back) cached copies of a memory block, incurring high overheads. This paper...
An-Chow Lai, Babak Falsafi