Sciweavers

4171 search results - page 759 / 835
» Choice numbers of graphs
Sort
View
AAAI
2007
15 years 8 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
NSDI
2007
15 years 8 months ago
R-BGP: Staying Connected in a Connected World
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
Nate Kushman, Srikanth Kandula, Dina Katabi, Bruce...
ASPDAC
2008
ACM
109views Hardware» more  ASPDAC 2008»
15 years 8 months ago
TCG-based multi-bend bus driven floorplanning
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
Tilen Ma, Evangeline F. Y. Young
ASPDAC
2008
ACM
88views Hardware» more  ASPDAC 2008»
15 years 8 months ago
REWIRED - Register Write Inhibition by Resource Dedication
We propose REWIRED (REgister Write Inhibition by REsource Dedication), a technique for reducing power during high level synthesis (HLS) by selectively inhibiting the storage of fun...
Pushkar Tripathi, Rohan Jain, Srikanth Kurra, Pree...
ATAL
2008
Springer
15 years 8 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan