Sciweavers

1693 search results - page 84 / 339
» fast 2008
Sort
View
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
FPGA
2008
ACM
168views FPGA» more  FPGA 2008»
13 years 10 months ago
Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs
The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an ...
Alessandro Cevrero, Panagiotis Athanasopoulos, Had...
ISCAS
2008
IEEE
144views Hardware» more  ISCAS 2008»
14 years 3 months ago
A novel VLSI iterative divider architecture for fast quotient generation
—In this paper, a novel VLSI iterative divider architecture for fast quotient generation that is based on radix-2 non-restoring division is proposed. To speed up the quotient gen...
Tso-Bing Juang, Sheng-Hung Chen, Shin-Mao Li