377 search results - page 27 / 76 » Distributionally Robust Optimization and Its Tractable Appro... |
140
click to vote
JGAA
2000
15 years 3 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
138
click to vote
LCPC
2000
Springer
15 years 7 months ago
2000
Springer
State-of-the-art run-time systems are a poor match to diverse, dynamic distributed applications because they are designed to provide support to a wide variety of applications, with...
134
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
146
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
155
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...