176 search results - page 11 / 36 » A Clustering Approach to Solving Large Stochastic Matching P... |
SIAMJO
2008
13 years 8 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
JCDL
2006
ACM
14 years 2 months ago
2006
ACM
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
CLOUDCOM
2010
Springer
13 years 6 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
DISOPT
2008
13 years 8 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
KCAP
2003
ACM
14 years 1 months ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...