13603 search results - page 222 / 2721 » On the Computational Complexity of Cut-Reduction |
237
click to vote
AAAI
2012
13 years 9 months ago
2012
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
188
click to vote
NSF
1994
Springer
15 years 10 months ago
1994
Springer
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...
212
click to vote
FCCM
2006
IEEE
15 years 10 months ago
2006
IEEE
With advances in reconfigurable hardware, especially field-programmable gate arrays (FPGAs), it has become possible to use reconfigurable hardware to accelerate complex applicatio...
195
click to vote
CCGRID
2001
IEEE
15 years 10 months ago
2001
IEEE
Resource management is an important infrastructure in the grid computing environment. Scalability and adaptability are two key challenges in the implementation of such complex sof...
198
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...