Sciweavers

2430 search results - page 322 / 486
» Computing Tutte Polynomials
Sort
View
163
Voted
FPL
2008
Springer
111views Hardware» more  FPL 2008»
15 years 5 months ago
Hyperreconfigurable architectures
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
Sebastian Lange, Martin Middendorf
ATAL
2010
Springer
15 years 4 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach
COMAD
2009
15 years 4 months ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
147
Voted
CORR
2008
Springer
208views Education» more  CORR 2008»
15 years 3 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
121
Voted
COMPUTING
2007
127views more  COMPUTING 2007»
15 years 3 months ago
Analyzing a generalized Loop subdivision scheme
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
Ingo Ginkel, Georg Umlauf