Sciweavers

1518 search results - page 289 / 304
» Exact and Approximate Bandwidth
Sort
View
ATAL
2005
Springer
14 years 9 days ago
Modeling opponent decision in repeated one-shot negotiations
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...
Sabyasachi Saha, Anish Biswas, Sandip Sen
COCOON
2005
Springer
14 years 8 days ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 8 days ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
FC
2005
Springer
143views Cryptology» more  FC 2005»
14 years 8 days ago
Risk Assurance for Hedge Funds Using Zero Knowledge Proofs
Abstract. This work introduces a new tool for a fund manager to verifiably communicate portfolio risk characteristics to an investor. We address the classic dilemma: How can an in...
Michael Szydlo
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 4 days ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran