273 search results - page 22 / 55 » Can Pure Cutting Plane Algorithms Work |
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In our previous work we have proposed a dynamic version of the consensus propagation (CP) algorithm introduced by Moallemi and Van Roy. Here, we pursue a system theoretic approach...
FPGA
2004
ACM
14 years 28 days ago
2004
ACM
As FPGA densities increase, partitioning-based FPGA placement approaches are becoming increasingly important as they can be used to provide high-quality and computationally scalab...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
TC
2010
13 years 6 months ago
2010
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...