1688 search results - page 4 / 338 » The Complexity of Rationalizing Matchings |
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
WINE
2005
Springer
13 years 11 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
CI
1998
13 years 5 months ago
1998
A rational agent (artificial or otherwise) residing in a complex changing environment must gather information perceptually, update that information as the world changes, and combi...
IEEECGIV
2008
IEEE
14 years 7 days ago
2008
IEEE
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the s...
VLSID
2002
IEEE
14 years 6 months ago
2002
IEEE
This paper introduces a new numerical approximation technique, called the Differential Quadrature Method (DQM), in order to derive the rational ABCD matrix representing the high-s...