1816 search results - page 86 / 364 » A New Approach for Solving the Maximum Clique Problem |
182
click to vote
RSCTC
2000
Springer
15 years 9 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
270
click to vote
MP
2006
15 years 6 months ago
2006
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensurin...
160
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
147
click to vote
BIBE
2007
IEEE
16 years 10 days ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
170
click to vote
ICPP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...