Sciweavers

2745 search results - page 502 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
145
Voted
JACM
2007
160views more  JACM 2007»
15 years 4 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
165
Voted
SIGMETRICS
2011
ACM
237views Hardware» more  SIGMETRICS 2011»
14 years 7 months ago
Analysis of DCTCP: stability, convergence, and fairness
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...
Mohammad Alizadeh, Adel Javanmard, Balaji Prabhaka...
DAC
2006
ACM
16 years 5 months ago
Prediction-based flow control for network-on-chip traffic
Networks-on-Chip (NoC) architectures provide a scalable solution to on-chip communication problem but the bandwidth offered by NoCs can be utilized efficiently only in presence of...
Ümit Y. Ogras, Radu Marculescu
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 4 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
WPES
2003
ACM
15 years 9 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...