8647 search results - page 461 / 1730 » The Container Selection Problem |
174
Voted
ECAI
1990
Springer
15 years 9 months ago
1990
Springer
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
152
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose a principled approach to summarization of visual data (images or video) based on optimization of a well-defined similarity measure. The problem we consider is re-target...
144
click to vote
ICDCS
2009
IEEE
16 years 2 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
154
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
163
click to vote
IPL
2007
15 years 5 months ago
2007
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...